約 6,471,295 件
https://w.atwiki.jp/i_ro/pages/166.html
This page has been marked as being in need of links (Item/Monster/Map) to a Database. This page has been marked as being in need of links to other iRO Wiki pages. For a pre-Renewal version of this article, click here. Job Base(s) Crusader Job Type 2-2 Transcendent Changes At Juno× Number of Skills 4 Total Skill Points 25 Total Quest Skills 0 Job Bonuses STR AGI VIT INT DEX LUK +9 +8 +10 +7 +8 +3 +← クリックで目次を開く Overview Job Change Guide BuildsGrand Cross Mobber The Speedfreak (Paladin Version) Grand Cross FS GC/GD/Sac Battle MR/RS Battle MR/GD/Sac Hybrid RS/Heal/GC Mob/WoE Support Sac/GD/BC TacticsWoE EquipmentTanking/Defense Class DataSkills Job Bonuses ASPD See Also External links Overview Do you believe in the gods? Witness the Paladin s might and see the power of the divine for yourself! Non-believers are sure to convert and sinners will repent! The Paladin is a shining symbol of piety and devotion who uses his fighting ability in the service of the gods and his fellow man. His skills can punish the wicked or inspire the faithful. Paladins are the Transcendent variant of the Crusader class. Aside from the HP×/SP× boost, the Paladin s defensive capabilities have not seen significant changes. They do receive many new offensive abilities which inspiring many INT-built Crusaders to become battle-built Paladins. For those Paladins who wish to continue as an INT-type build, the Battle Chant× skill allows them to play a supportive role in large party settings, and the 20 additional skills points allow them to learn a much wider variety of skills. Job Change Guide To become a Paladin, you must find a book called the Book of Ymir in Sage Castle , Juno×. The book will lead you to Valhalla so you can change your job through the Lord Knight job NPC×. Also you must reach at least job level 40 as a transcendent 1st class character. 1.Sage Castle is located at 11 o clock direction (yuno 88,320) in Juno. 2. Book of Ymir is located inside a room behind an NPC called Metheus Sylphe (yuno_in02 88,164). 3.The Book of Ymir (yuno_in02 94,206) will teleport you to Valhalla. 4.Find and talk to a job NPC suited to your 2nd class. Builds Grand Cross Mobber STR× 1-20 AGI× 1 VIT× 80-99 INT× 80-99 DEX× 30-60 LUK× 1 Primary Skills Grand Cross× Peco Peco Ride× Heal× Divine Protection× Guard× Essentially, nothing more than a standard Grand Cross Crusader taking advantage of the additional skill points and 30% HP/SP bonus to max out their defensive skills. Still built for PvM×, this build revolves around forming huge mobs and either tanking them for a Wizard / ME× Priest (benefiting from Guard, Divine Protection, and Heal) or obliterating them with Grand Cross. The Speedfreak (Paladin Version) STR 28 + 22 AGI 99 + 39 VIT 2 + 10 INT 1 + 17 DEX 98 + 18 LUK 1 + 33 All stat with priest buffs. Primary Skills Sword Mastery× Bash× Smite× Shield Boomerang× Rapid Smiting× Peco Peco Ride Cavalier Mastery× Guard Shield Reflect× Defending Aura× Equipments Card Ghost Bandana Angel Wing Ears Panties[1] with Loli Ruri Card Thin Blade with Cecil Damon Card x 2 Strong Shield Or Cross Shield with Enchanted Peach Tree Card Underskirt[1] with Jr Baphomet Card Black Leather Boots[1] with Antique Firelock Card Horn of Buffalo x 2 with Kukre Card x 2 Berserk Potion This is a PVM build that aims for MAX ASPD (190) to auto cast heal on the character while attacking. This build focus more on counter attacking (Shield Reflect) and defensive tactic (auto cast Heal, Guard, Defending Aura), rather than being highly offensive as their Lord Knight counterpart (see Lord Knight s Build The Speedfreak). This build would be more ideal for monster that do not have high defence, deal high damage or high hit. With the counter attacking and defensive tactic, this allows the player to hunt non-stop as there is no need to rest (usually Heal, Guard and Defender Aura will take care of the damage received and Shield Reflect helps bring the mob down). The downside to this build are low HP, low damage, limited equipment choice, and priest buff dependent. Grand Cross FS STR 1-20 AGI 1 VIT 55-80 INT 80-99 DEX 50-75 LUK 1 Primary Skills Grand Cross Peco Peco Ride Heal Sacrifice× Battle Chant Finally, for Grand Cross Crusaders who have longed to obtain both Heal and Sacrifice can now do so. This build revolves around spending the 20 extra skills points on Heal, Sacrifice, and Battle Chant to whatever balance floats their boat. Effective in many PvM/MvP× situations, and useful in WoE×, where the FS Paladin s high INT and moderate DEX make their Grand Cross formidable, and where their wide array of supportive skills will make them very popular with Wizards and Sages. GC/GD/Sac STR 1-20 AGI 1 VIT 55-80 INT 75-85 DEX 75-90 LUK 1 Primary Skills Grand Cross Peco Peco Ride Sacrifice Gloria Domini× Devastating in PvP and WoE, the Gloria Domini Paladin uses a heavy balance of DEX to pull off a Sacrifice for their Wizard or Sage in even the most hectic of situations. The same DEX is also used to turn Grand Cross into a deadly and surprising weapon, and allows them to use Gloria Domini to cripple their opponents from afar. With a little help from Magic Strings×, a Gloria Domini + Sacrifice Paladin in the precast can be a serious problem for enemy Priests, Wizards,Ninjas,Snipers, and Crusaders, who watch helplessly as their SP disappears. With the aid of a Minstrel s Bragis Poem, it can kill low HP classes in just a matter of seconds. Battle MR/RS STR 60-80 AGI 1-50 VIT 90-99 INT 20-30 DEX 30-70 LUK 1 Primary Skills Martyr s Reckoning× Shield Reflect Guard Divine Protection Rapid Smiting Shrink× Shield Boomerang Sacrifice (Optional) Defending Aura (Optional) The ultimate tank of the game. This Paladin pulls off a combination of the protective shield skills along with high VIT to guarantee survival. Martyr s Reckoning can be used to annihilate any monster or player without reduction gears. Rapid Smiting can be spammed on those who do carry them. This build can pull off the dangerous combo by hitting with Martyr s Reckoning while it is in the Rapid Smiting cool down. Defending Aura eliminates the threat of ranged attackers, while Shield Reflect makes sure that any Assassin or Knight who tries to sneak up on you will not get away without heavily damaging themselves as well. Outside of WoE, Shrink bounces back any foolish player or monster who s planning to get a quick kill on you. In case you confront a Wizard, Shield Boomerang will take care of them momentarily. The one major undeniable weakness of this type is that they are vulnerable to Full Divestment× and Divest Shield×. Considering the high DEX of the build though, most Rogues and Stalkers will find it hard to strip you. Battle MR/GD/Sac STR 30-50 AGI 60-90 VIT 80-99 INT 1 DEX 40-60 LUK 1 Primary Skills Martyr s Reckoning Sacrifice Shield Reflect Guard Defending Aura (Optional) Shrink Shield Boomerang Also the ultimate tank of the game. This Paladin pulls off a combination of the protective shield skills along with high VIT to guarantee survival. Martyr s Reckoning can be used to annihilate any monster or player without reduction gears. Defending Aura eliminates the threat of ranged attackers, while Shield Reflect makes sure that any Assassin or Knight who tries to sneak up on you will not get away without heavily damaging themselves as well.Outside of WoE, Shrink bounces back any foolish player or monster who s planning to get a quick kill on you. In case you confront a Wizard, Provoke× is the best choice to momentarily take care of them due to it s faster spam rate than the paladin s other ranged skills. One major undeniable weakness of this type is that they are vulnerable to Full Divestment and Divest Shield. Also this build will be utilizing mastela fruits or slim white potions due to the limited weight capacity. Considering the moderate DEX of the build, most Rogues and Stalkers will find it hard to strip you. You can Sacrifice wizards while on the defense, but again due to the mediocre DEX of this build, Sacrifice will be very difficult to pull off while on the offense in the midst of a precast. Martyr s Reckoning is able to be performed while sacrificing the wizards This is to maximize the damage by combining the fire power of Martyr s Reckoning with wizard s spells. Hybrid RS/Heal/GC STR 30-40 AGI 1 VIT 50-60 INT 85-95 DEX 60-70 LUK 1 Primary Skills Grand Cross Shield Reflect Guard Heal Rapid Smiting Shrink Shield Boomerang Sacrifice (Optional) Peco Peco Ride This build is very hard and can only be used with the right equips. But its the best build to throw anyone off guard. You need to focus on either Grand Cross or Rapid Smiting. When building make sure your equipment is either INT for Grand Cross or STR for Rapid Smiting. You will need to carry around 3-4 armours, 2-3 accessories and 1-2 weapons. With the STR you ll be able to handle the weight with peco peco but use the lightest most effective armours and only one main. The armours you ll want are pest, marc and angleing then add in anymore you want from there. The purpose of this build to throw out a surprise at any time. When people phsically attack you throw on the pest armour. After they get stoned cursed Grand Cross them to death. When wizards are casting storm gust put on marc and Rapid Smiting them. If you can get a ghostring you ll be laughing when archers attack you just walk up and Grand Cross or Rapid Smiting from afar. The most important thing of this build is its fast cast time and power. To achieve the best cast get a clock tower manager card or 2. Then get zerom gloves. for you shoes use Matyr/Sohee/Verit. And if you are going int get a 2 andre haedoggum or 2 zipper bears(the sp subtract won;t mean much to you.). But you ll have to play around with this build and it will take time to prefect it. Depending on what you come across you can possibly defend against anything. ALWAYS have blue potions. SP will run dry fast at least carry 20 blue potions at all times. You will be the ulimate emperium guard. You can stand on the emperium and grand cross and be able to target afar. So far this is a build in process but the results have proven effective. Mob/WoE Support Sac/GD/BC STR 1-60 AGI 1 VIT 80-99 INT 1-60 DEX 80-90+ LUK 1 Primary Skills Sacrifice Shield Reflect Guard Gloria Domini Battle Chant Shield Boomerang Peco Peco Ride This is a very expensive build, as you sacrifice Heal for Battle Chant and thus must rely on pots when mobbing ahead in a party. Be warned this build limits you to pretty much nothing but parties. It has the potential to be an incredible tank, and a force in WoE. The trade off is the huge benefit of Battle Chant for your party in WoE. This build is incredibly effective in WoE, armed with a fast Sacrifice, a Fast Gloria Domini that can sap SP quickly, and Battle Chant to buff/de-buff your party/opponents. Gloria Domini is extremely effective against a Champion that is aiming for you, and can be a pain for other classes SP reliant. The high Dex makes it harder for Stalkers to strip, and even if they do succeed, you can just Battle Chant to rid yourself of it. The high Vit/HP makes Guillotine Fist× not as lethal in some cases, as well as making you Stun× proof and pots more effective. Int and Str can be changed to your preferences Higher Weight Limit×, or higher SP max. This build is a more of a WoE support build, but can do excellently as a tank in places like Nameless or Thors. It is however, extremely reliant on pots. Tactics WoE During WoE, a Paladin s role depends heavily on the user s build. Objectively, most players expect Paladins to protect their teammates. A fast cast sacrifice is vital to the survival of your teammates. High VIT allows you to move around and keep up your HP without worrying about stun recovers more HP with healing items. Battle Chant is very useful in buffing your party, and inflicting status effects on an enemy. Here are some special uses for Battle Chant Allows Wizard and Sage classes to have instant cast spells Allows Monks and Champions to have additional ATK× and doubles their max SP for a very powerful Guillotine Fists Buffs Lord Knights and doubles their max HP to allow them to achieve 60k HP frenzies× Immunity to Status Effects× for one minute allows team mates to not freeze/stone curse/stun even without the appropriate gear/stats. In short, Battle Chant can be used both offensively to buff your allies before breaking a pre-cast. It can also be used defensively to increase the damage done by your allies, or to slow down invading armies by inflicting them with status effects. Another application of Battle Chant is that its negative buffs and damage can affect even cloaked characters and stalkers under stealth×. Another special effect of Battle Chant is that when activated, it removes all status effects both good(Priest buffs, ASPD potions) and bad(negative status effects including strip). Gloria Domini is a skill that cannot be missed. Depending on the Gloria Domini skill level, opponents will lose 20~40% of their current sp. The skill is best used with high DEX and within Magic Strings. Some uses of the skill Bypasses opponent s Paladin s sacrifice, good against Wizards with low HP. Reduces a Champion s SP, Guillotine Fist s damage will be reduced tremendously. Reduces a Assassin Cross or Stalker SP, lowering their amount of time for Cloaking× or Stealth. Martyr s Reckoning is a situational skill. While it achieves high damage-per-second with high VIT and high AGI, it drastically reduces your HP to half depending on the ASPD×. Some uses of the skill are as follows Assists in killing a Classical Pluck× team Kills anyone without a Ghostring Armor Very good against Gyspy/Dancer spamming Dazzler× Builds that are focused with solely Martyr s Reckoning will find that it is harder for Assassin Crosses to kill you and other melee classes to hit you. Equipment Tanking/Defense Main target of this equip set is gaining the highest DEF and HP. All equipment in this set should be over +7 upgraded. Preferably as high as possible. Top headgear Helm (6 DEF×) Bone Helm (7 DEF) Spiky Band (6 DEF)For slotted version this headgears you can use Grand Peco Card with Peco Peco Card (gain DEF + 3 VIT + 3) in slotted armor. Magni s Cap (5 DEF)Odin s Blessing, Stone Buckler Magni s Cap Equip Set give STR + 2, DEF + 5, MDEF + 5 [Swordman Class] Additional DEF + 6. Middle headgear Fin Helm (2 DEF) Lower headgear Iron Cain (1 DEF) Spare Card Evolved Pipe (1 VIT -5% Damage from Brute× Monsters) Body armor Legion Plate Armor [1] (11 DEF) Meteor Plate [1] (10 DEF) 30% resistance to the Stun and Freeze status) Odin s Blessing [1] (6 DEF) (only Odin s Blessing, Stone Buckler Magni s Cap Equip Set). Selected cards Peco Peco Card (Gain +10% Maximum HP and Equip Set with Grand Peco Card). You can use also use auto-status cards i.e. Sasquatch Card or Dark Frame Card . Mineral Card (Gain ATK - 25 DEF + 3) Marc Card (Gain protection from the Freeze) use only on freezing monsters. Garment Wool Scarf [1] (3 DEF) (Tidal Shoes Wool Scarf Equip Set) Pauldron [1] (5 DEF) Cards Raydric Card reduces Neutral damage by 20%. Frequently the best garment card to choose for this purpose. Shield Sacred Mission [1] (5 DEF) (INT + 2, VIT + 3, MDEF× + 3 Indestructible) Stone Buckler [1] (3 DEF) (only Odin s Blessing, Stone Buckler Magni s Cap Equip Set). Shield [1] (6 DEF) Cards Racial cards (-30% damage from respective race). Plant× Race lacks an implemented card. In this case, Size cards (-25% from respective size, i.e. Mysteltainn -25% from small 1 DEF) and Hodremlin (-15% from all sizes) may also be used. Footgear Vidar s Boots (4 DEF) (Maximum HP and SP + 9%) Tidal Shoes [1] (3 DEF) ([+ Wool Scarf] HP Recovery + 5%. Increase Maximum HP by 10%). Cards Upgrade under +9 - Verit Card (+8% HP/SP) , Matyr Card (+10% HP, AGI +1), Green Ferus Card (+10% HP, VIT +1) . Upgrade +9 or more - Firelock Soldier Card (+10% HP/SP, STR +2). Accessories Safety Ring (3 DEF, 3 MDEF) Alligator card ed Rosaries for magic and other long ranged skills. Yoyo card ed (Perfect Dodge× +5, AGI +1), preferably in Slotted Rosarie s (3 MDEF, LUK +1) Weapons Anything that adds maximum HP or reduces damage. weapon [4] i.e. Main Gauche with 4 x Fabre Card Combat Knife (-10% damage from Demi Human×s) Exorciser (-5% damage from Demon×s) Fortune Sword (+20 Perfect Dodge +5 LUK) Class Data Skills For information about Crusader skills, click here. Skill Description Levels Type Battle Chant× Begins a chant that inflicts a random status ailment on enemies within range, while also endowing party members with random buffs. 10 Supportive Gloria Domini× Crush a target with a huge cross from the sky, dealing fixed damage. 5 Offensive Martyr s Reckoning× Sacrifices the user s HP in order to deal great damage onto a target. 5 Offensive Rapid Smiting× Hurls the user s shield at a target, striking five times. 5 Offensive Job Bonuses Stat\Amount +1 +2 +3 +4 +5 +6 +7 +8 +9 +10 STR 2 10 18 26 33 40 48 55 64 AGI 3 8 16 24 37 52 60 70 VIT 1 9 15 21 30 42 49 53 63 69 INT 7 14 29 43 54 61 65 DEX 6 12 17 23 36 45 57 68 LUK 39 59 67 ASPD This article or section is in need of attention from an expert on the subject.Please help recruit one or improve this article yourself. See the talk page for details. See Also Swordman Crusader External links Skilltree at Himeyasha s Skill Simulator Grand Cross Calculator compares base Grand Cross damage amongst different weapons -Crusader ・ Paladin ・ Royal Guard Crusader ・ Paladin ・ Royal Guard 2nd ClassSkills Cavalier Mastery× ・ Cure× ・ Defending Aura× ・ Demon Bane× ・ Divine Protection× ・ Faith× ・ Grand Cross× ・ Guard× ・ Heal× ・ Holy Cross× ・ Peco Peco Ride× ・ Resistant Souls× ・ Sacrifice× ・ Shield Boomerang× ・ Shield Reflect× ・ Shrink× ・ Smite× ・ Spear Mastery× ・ Spear Quicken× TranscendentSkills Battle Chant× ・ Gloria Domini× ・ Martyr s Reckoning× ・ Rapid Smiting× 3rd ClassSkills Banding× ・ Banishing Point× ・ Burst Attack× ・ Cannon Spear× ・ Earth Drive× ・ Exceed Break× ・ Genesis Ray× ・ Hesperus Lit× ・ Inspiration× ・ Moon Slasher× ・ Overbrand× ・ Piety× ・ Pinpoint Attack× ・ Prestige× ・ Reflect Damage× ・ Shield Press× ・ Shield Spell× ・ Trample× ・ Vanguard Force× Quests Crusader Job Change Guide ・ Crusader Skill Quest ・ Rebirth Walkthrough ・ Royal Guard Job Change Guide Weapons× One Handed Sword× ・ Spear× ・ Two Handed Sword× -Classes of Ragnarok Online Classes of Ragnarok Online Novice Class Novice ・ High Novice ・ Super Novice First Class / High First Class Acolyte ・ Archer ・ Mage ・ Merchant ・ Swordman ・ Thief Second Class Priest ・ Monk ・ Hunter ・ Bard ・ Dancer ・ Wizard ・ Sage ・ Blacksmith ・ Alchemist ・ Knight ・ Crusader ・ Assassin ・ Rogue Transcendent Second Class High Priest ・ Champion ・ Sniper ・ Minstrel ・ Gypsy ・ High Wizard ・ Scholar ・ Mastersmith ・ Biochemist ・ Lord Knight ・ Paladin ・ Assassin Cross ・ Stalker Third Class Arch Bishop ・ Sura ・ Ranger ・ Maestro ・ Wanderer ・ Warlock ・ Sorcerer ・ Mechanic ・ Geneticist ・ Rune Knight ・ Royal Guard ・ Guillotine Cross ・ Shadow Chaser Expanded Class Gunslinger ・ Ninja ・ TaeKwon Kid Expanded Second Class TaeKwon Master ・ Soul Linker ・ Kagerou ・ Oboro ・ Rebel× Doram Summoner Categories Articles Needing DB Links | Articles Needing Interwiki Links | Paladin | Classes | Crusader
https://w.atwiki.jp/wiki5_milk/pages/19.html
https //www.rememberthemilk.comを使うとHTTPSでアクセスできます。 送信されるパスワードは常に暗号化されます。
https://w.atwiki.jp/todo314/pages/20.html
お役立ち情報 スケジュール https //confsearch.ethz.ch/?query=STOC+FOCS+SODA+CCC+ICALP+ITCS+LICS+IPCO+ISSAC+SoCG+PODS+COLT+EC+ESA+STACS+APPROX+RANDOM+MFCS+SWAT+WADS+ISAAC+FUN http //www.conferencelist.info/upcoming.html http //community.dur.ac.uk/tom.friedetzky/conf.html http //www.lix.polytechnique.fr/~hermann/conf.html http //csconf.net/deadlines 国際会議・雑誌 MSAR field ratings (2014) http //www.conferenceranks.com/visualization/msar2014.html Google scholar Top publications https //scholar.google.com/citations?view_op=top_venues vq=eng_theoreticalcomputerscience Ranking of CS Departments based on the Number of Papers in Theoretical Computer Science https //projects.csail.mit.edu/dnd/ranking/ Computer Science Conference Rankings https //webdocs.cs.ualberta.ca/~zaiane/htmldocs/ConfRanking.html Acceptance ratio of some Theoretical Computer Science Conferences https //www.lamsade.dauphine.fr/~sikora/ratio/confs.php ML-DM-AI Papers by Researchers in Japan https //knuu.github.io/pages/ml-dm-ai_jp_papers.html Conference Ranks http //www.conferenceranks.com/ Acceptance rates for the top-tier AI-related conferences https //github.com/lixin4ever/Conference-Acceptance-Rate https //perso.crans.org/genest/conf.html https //www.aminer.org/ranks/conf Computer Science Conference Rankings https //dsl.cds.iisc.ac.in/publications/CS_ConfRank.htm Journals (etc.) in Discrete Mathematics and related fields http //www.math.iit.edu/~kaul/Journals.html List of TCS conferences and workshops https //cstheory.stackexchange.com/questions/7900/list-of-tcs-conferences-and-workshops GII-GRIN-SCIE (GGS) Conference Rating http //www.consorzio-cini.it/gii-grin-scie-rating.html CORE Computer Science Journal Rankings http //cic.tju.edu.cn/faculty/zhileiliu/doc/COREComputerScienceJournalRankings.html Computer Science Conference Rank https //www.camille-kurtz.com/index_fichiers/html/CSRank.html CORE Conference Portal http //portal.core.edu.au/conf-ranks/ CORE Journal Portal http //portal.core.edu.au/jnl-ranks/ 中国计算机学会推荐 https //www.ccf.org.cn/Academic_Evaluation/By_category/ 清华大学计算机学科群 推荐学术会议和期刊列表 https //numbda.cs.tsinghua.edu.cn/~yuwj/TH-CPL.pdf 清华大学交叉信息研究院 重要国际学术会议及核心期刊 https //iiis.tsinghua.edu.cn/uploadfile/cs_conference_list.pdf 頂尖國際會議表列 https //www.csie.ncu.edu.tw/file/98ef5b203937077d24098c335abcf0ca 计算机学术期刊排名 https //sites.google.com/site/luzhaoshomepage/Home/journal-list/ji-suan-ji-xue-shu-qi-kan-pai-ming-computer-science-journal-rankings まとめサイト Best Paper Awards in Computer Science (since 1996) http //jeffhuang.com/best_paper_awards.html データベース勉強会Wiki http //www.kde.cs.tsukuba.ac.jp/dbreading/ Statistics of acceptance rate for the main AI conferences https //github.com/lixin4ever/Conference-Acceptance-Rate Hot Topics on Big Data Algorithms, Analytics and Applications https //www.cse.ust.hk/~leichen/courses/comp6311D/ http //akoide.hatenablog.com/ http //www.orgnet.com/hijackers.html http //11011110.livejournal.com/260838.html http //www.ipsj.or.jp/journal/info/75NC.html 専門知識の仕入れ方 by 吉田さん http //research.preferred.jp/2011/09/how-to-learn/ 岩間研の輪講 http //www.lab2.kuis.kyoto-u.ac.jp/fswikiout/wiki.cgi?action=LIST Laplacian Linear Equations, Graph Sparsification, Local Clustering, Low-Stretch Trees, etc. https //sites.google.com/a/yale.edu/laplacian/ Combinatorial Reconfiguration Wiki http //reconf.wikidot.com/ Connected Papers https //www.connectedpapers.com/ 英語論文の査読表現集 https //staff.aist.go.jp/a.ohta/japanese/study/Review_ex_top.htm Computational Intractability A Guide to Algorithmic Lower Bounds https //hardness.mit.edu/ What Books Should Everyone Read? https //cstheory.stackexchange.com/questions/3253/what-books-should-everyone-read Mathematical Writing by. Donald E. Knuth, Tracy Larrabee, and Paul M. Roberts https //jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf 講義 PCP and hardness of approximation 解説とか On Dinur s Proof of the PCP Theorem https //www.ams.org/journals/bull/2007-44-01/S0273-0979-06-01143-8/S0273-0979-06-01143-8.pdf クラスNPの新しい特徴づけ https //ipsj.ixsq.nii.ac.jp/ej/index.php?action=pages_view_main active_action=repository_action_common_download item_id=4159 item_no=1 attribute_id=1 file_no=1 page_id=13 block_id=8 https //cstheory.stackexchange.com/questions/45/what-are-good-references-to-understanding-the-proof-of-the-pcp-theorem https //www.cs.umd.edu/~gasarch/TOPICS/pcp/pcp.html https //sites.google.com/view/pcpfest/program Approximability of Optimization Problems (1999?, Madhu Sudan) http //people.csail.mit.edu/madhu/FT99/course.html ( low-degree test ) 😋CSE 532 Computational Complexity Essentials (2004, Paul Beame) https //courses.cs.washington.edu/courses/cse532/04sp/ ( low-degree test ) 😋CSE 533 The PCP Theorem and Hardness of Approximation (2005, Venkatesan Guruswami Ryan O Donnell) https //courses.cs.washington.edu/courses/cse533/05au/ (Dinur s proof) CS 294 PCP and Hardness of Approximation (2006, Luca Trevisan) https //cs.stanford.edu/people/trevisan/pcp/ (講義録少) 😋Course 236603 Probabilistically Checkable Proofs (2007, Eli Ben-Sasson) https //eli.net.technion.ac.il/files/2013/03/notes_2007_Fall.pdf (PCPP; robust PCP) CS359 Hardness of Approximation (Tim Roughgarden, 2007) https //timroughgarden.org/w07b/w07b.html (講義録少) 😋15-854(B) Advanced Approximation Algorithms (2008, Anupam Gupta Ryan O Donnell) https //www.cs.cmu.edu/~anupamg/adv-approx/ 😋6.895 Probabilistically Checkable Proofs and Hardness of Approximation (2010, Dana Moshkovitz) https //www.cs.utexas.edu/~danama/courses/pcp-mit/index.html ( low-degree test ) Prahladh Harsha CMSC 39600 PCPs, codes and inapproximability (2007, Prahladh Harsha) https //www.tifr.res.in/~prahladh/teaching/07autumn/ (講義録少) 😋Limits of approximation algorithms PCPs and Unique Games (2009―10, Prahladh Harsha) https //www.tifr.res.in/~prahladh/teaching/2009-10/limits/ ( low-degree test ) PCPs and Limits of approximation algorithms (2014―15, Prahladh Harsha) https //www.tifr.res.in/~prahladh/teaching/2014-15/limits/ (講義録少) Approximation Algorithms and Hardness of Approximation (2013, Ola Svensson Alantha Newman) https //theory.epfl.ch/osven/courses/Approx13/ (Dinur s proof) 😋CS294 Probabilistically Checkable and Interactive Proof Systems (2019, Alessandro Chiesa) http //people.eecs.berkeley.edu/~alexch/classes/CS294-S2019.html ( 講義動画神 , low-degree test) 15-859T A Theorist s Toolkit (2013, Ryan O Donnell) http //www.cs.cmu.edu/~odonnell/toolkit13/ Algorithmic Lower Bounds Fun with Hardness Proofs (2014/2019, Erik Demaine) https //ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-890-algorithmic-lower-bounds-fun-with-hardness-proofs-fall-2014/index.htm http //courses.csail.mit.edu/6.892/spring19/lectures/ CS395T Pseudorandomness (2017, David Zuckerman) https //www.cs.utexas.edu/~diz/395T/17/ Pseudorandomness (Salil Vadhan, monograph) https //people.seas.harvard.edu/~salil/pseudorandomness/ Expander graphs Expander Graphs and their applications (2020, Irit Dinur) https //www.wisdom.weizmann.ac.il/~dinuri/courses/20-expanders/index.htm Expander Graphs in Computer Science (2010, He Sun) https //resources.mpi-inf.mpg.de/departments/d1/teaching/ws10/EG/WS10.html Course 67659 Expander graphs and their applications (2002, Nati Linial Avi Wigderson) https //www.boazbarak.org/expandercourse/ Counting and Sampling Markov Chain Monte Carlo Methods (2006, Eric Vigoda) https //www.cc.gatech.edu/~vigoda/MCMC_Course/ CSE 599 Counting and Sampling (2017, Shayan Oveis Gharan) https //homes.cs.washington.edu/~shayan/courses/sampling/ CS 294 Markov Chain Monte Carlo Foundations Applications, (Alistair Sinclair) https //people.eecs.berkeley.edu/~sinclair/cs294/f09.html CS294-180 Partition Functions Algorithms Complexity (2020, Alistair Sinclair) https //people.eecs.berkeley.edu/~sinclair/cs294/f20.html CSE 599 Polynomial Paradigm in Algorithm Design (2020, Shayan Oveis Gharan) https //homes.cs.washington.edu/~shayan/courses/polynomials/ Math 270 The Geometry of Polynomials in Algorithms, Combinatorics, and Probability (2015, Nikhil Srivastava) https //math.berkeley.edu/~nikhil/courses/270/ Bridging Continuous and Discrete Optimization (2017) https //simons.berkeley.edu/programs/optimization2017 Geometry of Polynomials https //simons.berkeley.edu/programs/geometry2019 Counting and Sampling (2020, EPFL) https //www.epfl.ch/schools/ic/tcs/counting-and-sampling-2020/ Markov Chains and Counting (Alan Frieze, book) https //www.math.cmu.edu/~af1p/Teaching/MCC17/MC.html Others Parameterized Complexity (2019, Saket Saurabh) https //sites.google.com/view/sakethome/teaching/parameterized-complexity Proofs, beliefs, and algorithms through the lens of sum-of-squares https //www.sumofsquares.org/public/index.html Stat260/CompSci294 Topics in Spectral Graph Methods (Michael Mahoney) https //www.stat.berkeley.edu/~mmahoney/s15-stat260-cs294/ Topics in Theoretical Computer Science An Algorithmist s Toolkit (Jonathan Kelner) https //ocw.mit.edu/courses/mathematics/18-409-topics-in-theoretical-computer-science-an-algorithmists-toolkit-fall-2009/ 6.889 Algorithms for Planar Graphs and Beyond (Fall 2011) http //courses.csail.mit.edu/6.889/fall11/lectures/ 15-855 Graduate Computational Complexity Theory (2017, Ryan O Donnell) http //www.cs.cmu.edu/~odonnell/complexity17/ その他 Journals with quick reviewing - Theoretical Computer Science Stack Exchange https //cstheory.stackexchange.com/questions/8335/journals-with-quick-reviewing Backlog of MathematicsResearch Journals https //www.ams.org/journals/notices/201810/rnoti-p1289.pdf Online TCS Seminars https //cstheory.stackexchange.com/questions/46930/online-tcs-seminars Algorithms Randomization Computation https //sites.google.com/di.uniroma1.it/arc/home Felix Reidl https //tcs.rwth-aachen.de/~reidl/ https //rjlipton.wordpress.com/2014/12/21/modulating-the-permanent/ https //barthesi.gricad-pages.univ-grenoble-alpes.fr/personal-website/dpps/2018-26-11-dpps_intro/ Thirty-Three Miniatures Mathematical and Algorithmic Applications of Linear Algebra https //kam.mff.cuni.cz/~matousek/stml-53-matousek-1.pdf Research in Progress https //researchinprogress.tumblr.com/ 情報拡散 投票者モデル A model for spatial conflict Biometrika 1973 Ergodic theorems for weakly interacting infinite systems and the voter model Annals of Probability 1975. Influence Maximization 関連 バイラルマーケティング Mining the Network Value of Customers Mining Knowledge-Sharing Sites for Viral Marketing 元ネタ Maximizing the Spread of Influence through a Social Network 理論的結果 On the Approximability of Influence in Social Networks 影響最大化/影響力推定の爆速アルゴリズム シミュレーション CELF++ Optimizing the Greedy Algorithm for Influence Maximization in Social ... WWW 2011 Efficient Influence Maximization in Social Networks KDD 2009 StaticGreedy Solving the Scalability-Accuracy Dilemma in Influence Maximization CIKM 2013 UBLF An Upper Bound Based Approach to Discover Influential Nodes in Social ... ICDM 2013 An Upper Bound based Greedy Algorithm for Mining Top-k Influential Nodes in ... WWW 2014 Extracting Influential Nodes for Information Diffusion on a Social Network AAAI 2007 IMGPU GPU-Accelerated Influence Maximization in Large-Scale Social Networks TPDS 2014 Influence Maximization in Big Networks An Incremental Algorithm for ... IJCAI 2015 Influence at Scale Distributed Computation of Complex Contagion in Networks KDD 2015 Outward Influence and Cascade Size Estimation in Billion-scale Networks SIGMETRICS 2017 RIS Maximizing Social Influence in Nearly Optimal Time SODA 2014 Influence Maximization Near-Optimal Time Complexity Meets Practical Efficiency SIGMOD 2014 Social Influence Spectrum with Guarantees Computing More in Less Time CSoNet 2015 Influence Maximization in Near-Linear Time A Martingale Approach SIGMOD 2015 Cost-aware Targeted Viral Marketing in Billion-scale Networks INFOCOM 2016 Stop-and-Stare Optimal Sampling Algorithms for Viral Marketing in ... SIGMOD 2016 Revisiting the Stop-and-Stare Algorithms for Influence Maximization PVLDB 2017 Why approximate when you can get the exact? Optimal Targeted Viral Marketing ... INFOCOM 2017 Importance Sketching of Influence Dynamics in Billion-scale Networks ICDM 2017 ヒューリスティクス Scalable Influence Maximization for Prevalent Viral Marketing in Large-Scale ... KDD 2010 Scalable Influence Maximization in Social Networks under the Linear ... ICDM 2010 IRIE Scalable and Robust Influence Maximization in Social Networks ICDM 2012 Simulated Annealing Based Influence Maximization in Social Networks AAAI 2011 On Approximation of Real-World Influence Spread PKDD 2012 Scalable and Parallelizable Processing of Influence Maximization for ... ICDE 2013 Simpath An Efficient Algorithm for Influence Maximization under the Linear ... ICDM 2011 Probabilistic Solutions of Influence Propagation on Networks CIKM 2013 Community-based Greedy Algorithm for Mining Top-K Influential Nodes in ... KDD 2010 Efficient algorithms for influence maximization in social networks KAIS 2012 CINEMA Conformity-Aware Greedy Algorithm for Influence Maximization in ... EDBT 2013 A Novel and Model Independent Approach for Efficient Influence Maximization ... WISE 2013 Influence Spread in Large-Scale Social Networks - A Belief Propagation Approach ECML PKDD 2012 IMRank Influence Maximization via Finding Self-Consistent Ranking SIGIR 2014 ASIM A Scalable Algorithm for Influence Maximization under the Independent ... WWW 2015 Holistic Influence Maximization Combining Scalability and Efficiency with ... SIGMOD 2016 影響拡散高速計算 Efficient influence spread estimation for influence maximization under the ... Exact Computation of Influence Spread by Binary Decision Diagrams WWW 2017 Computing and maximizing influence in linear threshold and triggering models NIPS 2016 その他 Influence Maximization in Undirected Networks SODA 2014 Debunking the Myths of Influence Maximization An In-Depth Benchmarking Study SIGMOD 2017 謎 Maximizing the Spread of Cascades Using Network Design UAI 2010 The complexity of influence maximization problem in the deterministic linear ... JCO 2012 目的関数が違う Personalized Influence Maximization on Social Networks Stability of Influence Maximization Minimizing Seed Set Selection with Probabilistic Coverage Guarantee in a ... On minimizing budget and time in influence propagation over social networks Minimizing Seed Set for Viral Marketing Online Influence Maximization Minimum-Cost Information Dissemination in Social Networks Robust Influence Maximization (He-Kempe) Robust Influence Maximization (Chen+) Robust Influence Maximization (Lowalekar+) Spheres of Influence for More Effective Viral Marketing 変種設定 インターネット広告 Real-time Targeted Influence Maximization for Online Advertisements VLDB 2015 Viral Marketing Meets Social Advertising Ad Allocation with Minimum Regret VLDB 2015 Revenue Maximization in Incentivized Social Advertising VLDB 2017 疎化・粗大化 Sparsification of Influence Networks Fast Influence-based Coarsening for Large Networks 予測 Prediction of Information Diffusion Probabilities for Independent Cascade Model Learning Continuous-Time Information Diffusion Model for Social Behavioral ... Learning Influence Probabilities In Social Networks Learning Stochastic Models of Information Flow Predicting Information Diffusion on Social Networks with Partial Knowledge Latent Feature Independent Cascade Model for Social Propagation Learning Diffusion Probability based on Node Attributes in Social Networks Topic-aware Social Influence Propagation Models Uncovering the Temporal Dynamics of Diffusion Networks モデリング 時間 A Data-Based Approach to Social Influence Maximization Time-Critical Influence Maximization in Social Networks with Time-Delayed ... Time Constrained Influence Maximization in Social Networks Uncovering the Temporal Dynamics of Diffusion Networks On Influential Node Discovery in Dynamic Social Networks Influence Maximization with Novelty Decay in Social Networks トピック・カテゴリ Topic-aware Social Influence Propagation Models Diversified Social Influence Maximization モデルは同じ,目的関数が違う トピック・カテゴリのアルゴリズム Online Topic-aware Influence Maximization Queries EDBT 2014 Real-time Topic-aware Influence Maximization Using Preprocessing CSoNet 2015 Online Topic-Aware Influence Maximization VLDB 2015 負/競合 Competitive Influence Maximization in Social Networks WINE 2007 Word of Mouth Rumor Dissemination in Social Networks SIROCCO 2008 Threshold Models for Competitive Influence in Social Networks WINE 2010 Influence Maximization in Social Networks When Negative Opinions May Emerge ... Influence Blocking Maximization in Social Networks under the Competitive ... Maximizing Influence in a Competitive Social Network A Follower s Perspective ICEC 2007 New Models for Competitive Contagion Opinion maximization in social networks 意見 Maximizing Influence in an Ising Network A Mean-Field Optimal Solution Isingモデル 投票者モデル オリジナル Ergodic Theorems for Weakly Interacting Infinite Systems and the Voter Model A Model for Spatial Conflict A Note on Maximizing the Spread of Influence in Social Networks WINE 2007 Influence Diffusion Dynamics and Influence Maximization in Social Networks ... WSDM 2013 Maximizing the Long-term Integral Influence in Social Networks Under the ... WWW 2014 適応的二段階アプローチ Scalable Methods for Adaptively Seeding a Social Network WWW 2015 その他 How to Influence People with Partial Incentives Mining Social Networks Using Heat Diffusion Processes for Marketing ... Influence Maximization with Viral Product Design Profit Maximization over Social Networks On Budgeted Influence Maximization in Social Networks In Search of Influential Event Organizers in Online Social Networks Linear Computation for Independent Social Influence Efficient Location-Aware Influence Maximization Dynamic Influence Maximization Under Increasing Returns to Scale Online Influence Maximization Real-time Targeted Influence Maximization for Online Advertisements VLDB 2015 連続時間独立カスケード(CT-IC)モデル Uncovering the Temporal Dynamics of Diffusion Networks ICML 2011 Influence Maximization in Continuous Time Diffusion Networks ICML 2012 Scalable Influence Estimation in Continuous-Time Diffusion Networks NIPS 2013 Tight Bounds for Influence in Diffusion Networks and Application to Bond ... NIPS 2014 Anytime Influence Bounds and the Explosive Behavior of Continuous-Time ... NIPS 2015 汚染最小化 Minimizing the Spread of Contamination by Blocking Links in a Network Blocking Links to Minimize Contamination Spread in a Social Network Negative Influence Minimizing by Blocking Nodes in Social Networks Finding Spread Blockers in Dynamic Networks 動的アルゴリズム Influence Maximization in Dynamic Social Networks Maximizing the Extent of Spread in a Dynamic Network On Influential Nodes Tracking in Dynamic Social Networks Real-Time Influence Maximization on Dynamic Social Streams PVLDB 2017 斉藤 和巳さん一派 Tractable Models for Information Diffusion in Social Networks PKDD 2006 Extracting Influential Nodes for Information Diffusion on a Social Network AAAI 2007 Minimizing the Spread of Contamination by Blocking Links in a Network AAAI 2008 Prediction of Information Diffusion Probabilities for Independent Cascade Model KES 2008 Learning Continuous-Time Information Diffusion Model for Social Behavioral ... ACML 2009 Selecting Information Diffusion Models over Social Networks for Behavioral ... ECML PKDD 2010 (ACML 09と同じ?) Blocking Links to Minimize Contamination Spread in a Social Network TKDD 2009 Finding Influential Nodes in a Social Network from Information Diffusion Data SBP 2009 Learning information diffusion model in a social network for predicting influence of nodes Intell. Data Anal. 2011 Learning Diffusion Probability based on Node Attributes in Social Networks ISMIS 2011 Uncertain Graphs On a Routing Problem Within Probabilistic Graphs ... INFOCOM 2007 The Most Reliable Subgraph Problem PKDD 2007 Frequent Subgraph Pattern Mining on Uncertain Graph Data CIKM 2009 Fast Discovery of Reliable Subnetworks ASONAM 2010 k-Nearest Neighbors in Uncertain Graphs VLDB 2010 Finding Top-k Maximal Cliques in an Uncertain Graph ICDE 2010 Fast Discovery of Reliable k-terminal Subgraphs PAKDD 2010 Discovering Frequent Subgraphs over Uncertain Graph Databases under ... KDD 2010 BMC An Efficient Method to Evaluate Probabilistic Reachability Queries DASFAA 2011 Efficient Discovery of Frequent Subgraph Patterns in Uncertain Graph Databases EDBT 2011 Discovering Highly Reliable Subgraphs in Uncertain Graphs KDD 2011 Distance Constraint Reachability Computation in Uncertain Graphs VLDB 2011 Efficient Subgraph Search over Large Uncertain Graphs VLDB 2011 Reliable Clustering on Uncertain Graphs ICDM 2012 Polynomial-Time Algorithm for Finding Densest Subgraphs in Uncertain Graphs MLG 2013 Clustering Large Probabilistic Graphs TKDE 2013 The Pursuit of a Good Possible World Extracting Representative Instances of ... SIGMOD 2014 Efficient and Accurate Query Evaluation on Uncertain Graphs via Recursive ... ICDE 2014 Fast Reliability Search in Uncertain Graphs EDBT 2014 Top-k Reliable Edge Colors in Uncertain Graphs CIKM 2015 Top-k Reliability Search on Uncertain Graphs ICDM 2015 Assessing Attack Vulnerability in Networks with Uncertainty INFOCOM 2015 Triangle-Based Representative Possible Worlds of Uncertain Graphs DASFAA 2016 Truss Decomposition of Probabilistic Graphs Semantics and Algorithms SIGMOD 2016 ネットワーク信頼性 A practical bounding algorithm for computing two-terminal reliability based ... Comput. Math. Appl. 2011 OR系 Minimum-Risk Maximum Clique Problem k-means Streaming k-means approximation StreamKM++ A Clustering Algorithm for Data Streams k-means++ The Advantages of Careful Seeding Streaming k-means on Well-Clusterable Data A Local Search Approximation Algorithm for k-Means Clustering Fast and Accurate k-means For Large Datasets Hartigan s Method k-means Clustering without Voronoi Hartigan s K-Means Versus Lloyd s K-Means - Is It Time for a Change? Using the Triangle Inequality to Accelerate k-Means Making k-means even faster Accelerated k-means with adaptive distance bounds PageRank 高速計算 Extrapolation Methods for Accelerating PageRank Computations FAST-PPR Scaling Personalized PageRank Estimation for Large Graphs 動的更新 Link Evolution Analysis and Algorithms Fast Incremental and Personalized PageRank PageRank on an Evolving Graph Efficient PageRank Tracking in Evolving Networks 私,前原貴憲,河原林健一 バックボタン The Effect of the Back Button in a Random Walk Application for PageRank BackRank an Alternative for PageRank? Spectral Clustering A Random Walks View of Spectral Segmentation Kernel k-means, Spectral Clustering and Normalized Cuts http //ranger.uta.edu/~chqding/Spectral/ https //arxiv.org/abs/0711.0189 A Tutorial on Spectral Clustering. Ulrike von Luxburg Laplacian https //sites.google.com/a/yale.edu/laplacian/ 理論計算機科学 + ... ACM Symposium on Theory of Computing STOC 2013 Fast Approximation Algorithms for the Diameter and Radius of Sparse Graphs STOC 2014 The matching polytope has exponential extension complexity Approximation Algorithms for Regret-Bounded Vehicle Routing and Applications ... Approximate Distance Oracle with Constant Query Time Zig-zag Sort A Simple Deterministic Data-Oblivious Sorting Algorithm ... Minimum Bisection is Fixed Parameter Tractable IEEE Symposium on Foundations of Computer Science FOCS 2013 https //sites.google.com/site/tcsreading/home/focs2013 The Price of Stability for Undirected Broadcast Network Design with Fair ... Learning Sums of Independent Integer Random Variables OSNAP Faster numerical linear algebra algorithms via sparser subspace ... Efficient Accelerated Coordinate Descent Methods and Faster Algorithms for ... Algebraic Algorithms for b-Matching, Shortest Undirected Paths, and f-Factors Improved approximation for 3-dimensional matching via bounded pathwidth ... Independent Set, Induced Matching, and Pricing Connections and Tight ... Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free ... Online Node-weighted Steiner Forest and Extensions via Disk Paintings An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting ... Approximating Bin Packing within O(log OPT*loglog OPT) bins Strong Backdoors to Bounded Treewidth SAT ACM-SIAM Symposium on Discrete Algorithms SODA 2008 On the Approximability of Influence in Social Networks SODA 2014 Maximizing Social Influence in Nearly Optimal Time Influence Maximization in Undirected Networks International Symposium on Algorithms and Computation ACM Conference on Innovations in Theoretical Computer Science アルゴリズム + ... Workshop on Algorithm Engineering and Experiments ALENEX 2016 Computing Top-k Closeness Centrality Faster in Unweighted Graphs International Symposium on Experimental Algorithms SEA 2015 Is Nearly-linear the Same in Theory and Practice? A Case Study with a ... Workshop on Algorithms and Models for the Web Graph WAW 2012 Dynamic PageRank using Evolving Teleportation SIGMETRICS 2017 Outward Influence and Cascade Size Estimation in Billion-scale Networks ジャーナル版はProceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS) データマイニング + ... ACM SIGKDD Conference on Knowledge Discovery and Data Mining KDD 2001 Mining the Network Value of Customers Co-clustering documents and words using Bipartite Spectral Graph Partitioning KDD 2002 Mining Knowledge-Sharing Sites for Viral Marketing KDD 2007 ✔Cost-effective Outbreak Detection in Networks KDD 2008 ✔Influence and Correlation in Social Networks KDD 2009 Efficient Influence Maximization in Social Networks ✔On Compressing Social Networks KDD 2010 Inferring Networks of Diffusion and Influence Scalable Influence Maximization for Prevalent Viral Marketing in Large-Scale ... Community-based Greedy Algorithm for Mining Top-K Influential Nodes in ... Discovering Frequent Subgraphs over Uncertain Graph Databases under ... Semi-Supervised Feature Selection for Graph Classification KDD 2011 Discovering Highly Reliable Subgraphs in Uncertain Graphs Sparsification of Influence Networks KDD 2012 Streaming Graph Partitioning for Large Distributed Graphs PageRank on an Evolving Graph Information Diffusion and External Influence in Networks Vertex Neighborhoods, Low Conductance Cuts, and Good Seeds for Local ... Information Propagation Game a Tool to Acquire Human Playing Data for ... Chromatic Correlation Clustering Efficient Personalized PageRank with Accuracy Assurance KDD 2013 Denser than the Densest Subgraph Extracting Optimal Quasi-Cliques with ... Redundancy-Aware Maximal Cliques Trial and Error in Influential Social Networks Workshop on Mining and Learning with Graphs (MLG) Polynomial-Time Algorithm for Finding Densest Subgraphs in Uncertain Graphs KDD 2014 Stability of Influence Maximization Minimizing Seed Set Selection with Probabilistic Coverage Guarantee in a ... Heat Kernel Based Community Detection Balanced Graph Edge Partition Correlation Clustering in MapReduce Streaming Submodular Maximization Massive Data Summarization on the Fly Fast Influence-based Coarsening for Large Networks FAST-PPR Scaling Personalized PageRank Estimation for Large Graphs KDD 2015 Influence at Scale Distributed Computation of Complex Contagion in Networks Efficient Algorithms for Public-Private Social Networks Reciprocity in Social Networks with Capacity Constraints Online Influence Maximization Locally Densest Subgraph Discovery ✔Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling Non-exhaustive, Overlapping Clustering via Low-Rank Semidefinite Programming KDD 2016 ✔Robust Influence Maximization (He-Kempe) Robust Influence Maximization (Chen+) FRAUDAR Bounding Graph Fraud in the Face of Camouflage KDD 2018 Approximating the Spectrum of a Graph IEEE International Conference on Data Mining ICDM 2006 Fast Random Walk with Restart and Its Applications ICDM 2010 Scalable Influence Maximization in Social Networks under the Linear ... Modeling Information Diffusion in Implicit Networks ICDM 2011 Simpath An Efficient Algorithm for Influence Maximization under the Linear ... On the Hardness of Graph Anonymization Overlapping correlation clustering Minimizing Seed Set for Viral Marketing ICDM 2012 Reliable Clustering on Uncertain Graphs IRIE Scalable and Robust Influence Maximization in Social Networks Predicting Directed Links using Nondiagonal Matrix Decompositions Inferring the Underlying Structure of Information Cascades Topic-aware Social Influence Propagation Models Time Constrained Influence Maximization in Social Networks Profit Maximization over Social Networks ICDM 2013 Influence Maximization in Dynamic Social Networks UBLF An Upper Bound Based Approach to Discover Influential Nodes in Social ... Influence-based Network-oblivious Community Detection Linear Computation for Independent Social Influence ICDM 2014 Quick Detection of High-degree Entities in Large Directed Networks ICDM 2015 Top-k Reliability Search on Uncertain Graphs ✔Catching the head, tail, and everything in between a streaming algorithm ... ICDM 2017 Importance Sketching of Influence Dynamics in Billion-scale Networks European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases PKDD 2006 Tractable Models for Information Diffusion in Social Networks PKDD 2007 The Most Reliable Subgraph Problem PKDD 2012 On Approximation of Real-World Influence Spread ECML PKDD 2010 Selecting Information Diffusion Models over Social Networks for Behavioral ... ECML PKDD 2012 Influence Spread in Large-Scale Social Networks - A Belief Propagation Approach ECML PKDD 2016 Temporal PageRank SIAM International Conference on Data Mining SDM 2010 Fast Single-Pair SimRank Computation SDM 2011 Influence Maximization in Social Networks When Negative Opinions May Emerge ... Maximising the Quality of Influence SDM 2012 On Influential Node Discovery in Dynamic Social Networks Influence Blocking Maximization in Social Networks under the Competitive ... ✔Fast Robustness Estimation in Large Social Graphs Communities and Anomaly ... SDM 2013 Triadic Measures on Graphs The Power of Wedge Sampling k-means-- A unified approach to clustering and outlier detection Opinion maximization in social networks SDM 2014 Influence Maximization with Viral Product Design Future Influence Ranking of Scientific Literature VoG Summarizing and Understanding Large Graphs Make It or Break It Manipulating Robustness in Large Networks Accelerating Graph Adjacency Matrix Multiplications with Adjacency Forest SDM 2015 Selecting Shortcuts for a Smaller World Where Graph Topology Matters The Robust Subgraph Problem On Influential Nodes Tracking in Dynamic Social Networks ✔Non-exhaustive, Overlapping k-means SDM 2017 A Dual-tree Algorithm for Fast k-means Clustering with Large k Pacific-Asia Conference on Knowledge Discovery and Data Mining PAKDD 2010 Fast Discovery of Reliable k-terminal Subgraphs ソーシャルネットワーク + ... IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining ASONAM 2009 Spectral Counting of Triangles in Power-Law Networks via Element-Wise ... Reducing Social Network Dimensions Using Matrix Factorization Methods Dynamic and Static Influence Models on Starbucks Networks ASONAM 2010 Fast Discovery of Reliable Subnetworks ASONAM 2011 Dynamic Social Influence Analysis through Time-dependent Factor Graphs ASONAM 2012 Influence of the Dynamic Social Network Timeframe Type and Size on the Group ... Diffusion Centrality in Social Networks Visual Analysis of Dynamic Networks using Change Centrality ASONAM 2014 Diversified Social Influence Maximization ASONAM 2015 Structure-Preserving Sparsification of Social Networks ACM Conference on Online Social Networks COSN 2013 Scalable Similarity Estimation in Social Networks Closeness, Node Labels, ... Counting Triangles in Large Graphs using Randomized Matrix Trace Estimation International Conference on Computational Social Networks CSoNet 2015 Real-time Topic-aware Influence Maximization Using Preprocessing Social Influence Spectrum with Guarantees Computing More in Less Time SNA-KDD (International Workshop on Social Network Mining and Analysis) Finding Spread Blockers in Dynamic Networks データベース + ... ACM SIGMOD International Conference on Management of Data SIGMOD 2011 On k-skip Shortest Paths Local Graph Sparsification for Scalable Clustering SIGMOD 2013 Massive Graph Triangulation Efficiently Computing k-Edge Connected Components via Graph Decomposition I/O Efficient Computing SCCs in Massive Graphs TurboISO Towards Ultrafast and Robust Subgraph Isomorphism Search in Large ... TF-Label a Topological-Folding Labeling Scheme for Reachability Querying in ... Online Search of Overlapping Communities Efficient Ad-hoc Search for Personalized PageRank SIGMOD 2014 In Search of Influential Event Organizers in Online Social Networks Efficient Location-Aware Influence Maximization Querying K-Truss Community in Large and Dynamic Graph The Pursuit of a Good Possible World Extracting Representative Instances of ... Influence Maximization Near-Optimal Time Complexity Meets Practical Efficiency SIGMOD 2015 COMMIT A Scalable Approach to Mining Communication Motifs from Dynamic Networks Minimum Spanning Trees in Temporal Graphs Influence Maximization in Near-Linear Time A Martingale Approach SIGMOD 2016 Spheres of Influence for More Effective Viral Marketing ✔Speedup Graph Processing by Graph Ordering Distributed Set Reachability ✔Truss Decomposition of Probabilistic Graphs Semantics and Algorithms Holistic Influence Maximization Combining Scalability and Efficiency with ... Stop-and-Stare Optimal Sampling Algorithms for Viral Marketing in ... TIM+やIMMより高性能(と謳う)影響最大化アルゴリズム SIGMOD 2017 Debunking the Myths of Influence Maximization An In-Depth Benchmarking Study Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling DAG Reduction Fast Answering Reachability Queries Scaling Locally Linear Embedding Dynamic Density Based Clustering IEEE International Conference on Data Engineering ICDE 2010 Finding Top-k Maximal Cliques in an Uncertain Graph ICDE 2011 Outlier Detection in Graph Streams ICDE 2012 Learning Stochastic Models of Information Flow Extracting Analyzing and Visualizing Triangle K-Core Motifs within Networks ICDE 2013 Scalable and Parallelizable Processing of Influence Maximization for ... Scalable Maximum Clique Computation Using MapReduce Faster Random Walks By Rewiring Online Social Networks On-The-Fly Sampling Node Pairs Over Large Graphs ICDE 2014 How to Partition a Billion-Node Graph Random-walk Domination in Large Graphs Evaluating Multi-Way Joins over Discounted Hitting Time Efficient and Accurate Query Evaluation on Uncertain Graphs via Recursive ... International Conference on Very Large Data Bases VLDB 2010 Shortest Path Computation on Air Indexes Fast Incremental and Personalized PageRank k-Nearest Neighbors in Uncertain Graphs VLDB 2011 On Triangulation-based Dense Neighborhood Graph Discovery Distance Constraint Reachability Computation in Uncertain Graphs Efficient Subgraph Search over Large Uncertain Graphs VLDB 2012 Keyword-aware Optimal Route Search gSketch On Query Estimation in Graph Streams A Data-Based Approach to Social Influence Maximization Scalable K-Means++ Fast and Exact Top-k Search for Random Walk with Restart VLDB 2013 iRoad A Framework For Scalable Predictive Query Processing On Road Networks Top-K Nearest Keyword Search on Large Graphs Memory Efficient Minimum Substring Partitioning Piggybacking on Social Networks Streaming Algorithms for k-core Decomposition VLDB 2014 More is Simpler Effectively and Efficiently Assessing Node Pair ... On k-Path Covers and their Applications Crowdsourcing Algorithms for Entity Resolution VLDB 2015 Viral Marketing Meets Social Advertising Ad Allocation with Minimum Regret Online Topic-Aware Influence Maximization Real-time Targeted Influence Maximization for Online Advertisements VLDB 2016 Fast Algorithm for the Lasso based L1-Graph Construction Online Entity Resolution Using an Oracle VLDB 2017 Revenue Maximization in Incentivized Social Advertising Real-Time Influence Maximization on Dynamic Social Streams Revisiting the Stop-and-Stare Algorithms for Influence Maximization ACM International Conference on Information and Knowledge Management CIKM 2008 Mining Social Networks Using Heat Diffusion Processes for Marketing ... The query-flow graph model and applications CIKM 2009 Frequent Subgraph Pattern Mining on Uncertain Graph Data CIKM 2011 Suggesting Ghost Edges for a Smaller World CIKM 2012 Delineating Social Network Data Anonymization via Random Edge Perturbation ✔Gelling, and Melting, Large Graphs by Edge Manipulation CIKM 2013 StaticGreedy Solving the Scalability-Accuracy Dilemma in Influence Maximization Personalized Influence Maximization on Social Networks Probabilistic Solutions of Influence Propagation on Networks Efficiently Anonymizing Social Networks with Reachability Preservation Overlapping Community Detection Using Seed Set Expansion CIKM 2014 Pushing the Envelope in Graph Compression CIKM 2015 Top-k Reliable Edge Colors in Uncertain Graphs International Conference on Extending Database Technology EDBT 2011 Efficient Discovery of Frequent Subgraph Patterns in Uncertain Graph Databases EDBT 2013 CINEMA Conformity-Aware Greedy Algorithm for Influence Maximization in ... EDBT 2014 Online Topic-aware Influence Maximization Queries Privacy Preserving Estimation of Social Influence ✔Fast Reliability Search in Uncertain Graphs EDBT 2015 Identifying Converging Pairs of Nodes on a Budget International Conference on Database Systems for Advanced Applications DASFAA 2011 BMC An Efficient Method to Evaluate Probabilistic Reachability Queries DASFAA 2016 Triangle-Based Representative Possible Worlds of Uncertain Graphs ウェブ + ... International World Wide Web Conference WWW 2003 Extrapolation Methods for Accelerating PageRank Computations WWW 2004 The Effect of the Back Button in a Random Walk Application for PageRank RandomSurfer with Back Step Propagation of Trust and Distrust WWW 2005 BackRank an Alternative for PageRank? WWW 2007 Wherefore Art Thou R3579X? Anonymized Social Networks, Hidden Patterns, and ... WWW 2008 Fast Algorithms for Top-k Personalized PageRank Queries WWW 2009 Towards Context-Aware Search by Learning A Very Large Variable Length Hidden ... WWW 2010 Sampling Community Structure Stochastic Models for Tabbed Browsing Tracking the Random Surfer Empirically Measured Teleportation Parameters in ... WWW 2011 Limiting the Spread of Misinformation in Social Networks Estimating Sizes of Social Networks via Biased Sampling CELF++ Optimizing the Greedy Algorithm for Influence Maximization in Social ... WWW 2012 The Role of Social Networks in Information Diffusion Analyzing Spammer s Social Networks for Fun and Profit Human Wayfinding in Information Networks Optimizing Budget Allocation Among Channels and Influencers Recommendations to Boost Content Spread in Social Networks WWW 2013 Subgraph Frequencies Mapping the Empirical and Extremal Geography of Large ... Estimating Clustering Coefficients and Size of Social Networks via Random Walk Spectral Analysis of Communication Networks Using Dirichlet Eigenvalues WWW 2014 How to Influence People with Partial Incentives An Upper Bound based Greedy Algorithm for Mining Top-k Influential Nodes in ... ポスター Maximizing the Long-term Integral Influence in Social Networks Under the ... ポスター WWW 2015 Path Sampling A Fast and Provable Method for Estimating 4-Vertex Subgraph ... ✔The K-clique Densest Subgraph Problem ASIM A Scalable Algorithm for Influence Maximization under the Independent ... ✔Scalable Methods for Adaptively Seeding a Social Network WWW 2017 Why Do Cascade Sizes Follow a Power-Law? Exact Computation of Influence Spread by Binary Decision Diagrams ACM International Conference on Web Search and Data Mining WSDM 2010 TwitterRank Finding Topic-sensitive Influential Twitterers Learning Influence Probabilities In Social Networks WSDM 2013 On the Streaming Complexity of Computing Local Clustering Coefficients Influence Diffusion Dynamics and Influence Maximization in Social Networks ... From Machu_Picchu to rafting the urubamba river Anticipating information ... WSDM 2015 Negative Link Prediction in Social Media On Integrating Network and Community Discovery The Power of Random Neighbors in Social Networks International Conference on Weblogs and Social Media ICWSM 2010 ICWSM - A Great Catchy Name Semi-Supervised Recognition of Sarcastic ... ICWSM 2011 4chan and /b/ An Analysis of Anonymity and Ephemerality in a Large Online ... 人工知能 + ... AAAI Conference on Artificial Intelligence AAAI 2007 Extracting Influential Nodes for Information Diffusion on a Social Network AAAI 2008 Minimizing the Spread of Contamination by Blocking Links in a Network AAAI 2010 EWLS A New Local Search for Minimum Vertex Cover AAAI 2011 Simulated Annealing Based Influence Maximization in Social Networks Nonnegative Spectral Clustering with Discriminative Regularization AAAI 2012 Exacting Social Events for Tweets Using a Factor Graph Time-Critical Influence Maximization in Social Networks with Time-Delayed ... Two New Local Search Strategies for Minimum Vertex Cover AAAI 2013 Sensitivity of Diffusion Dynamics to Network Uncertainty Spectral Rotation versus K-Means in Spectral Clustering Fast and Exact Top-k Algorithm for PageRank workshop Negative Influence Minimizing by Blocking Nodes in Social Networks AAAI 2014 New Models for Competitive Contagion Influence Maximization with Novelty Decay in Social Networks Rounded Dynamic Programming for Tree-Structured Stochastic Network Design Theory of Cooperation in Complex Social Networks AAAI 2015 Two Weighting Local Search for Minimum Vertex Cover AAAI 2016 Approximate K-Means++ in Sublinear Time AAAI 2018 Risk-Sensitive Submodular Optimization International Joint Conference on Artificial Intelligence IJCAI 2001 Link Analysis, Eigenvectors and Stability IJCAI 2009 Efficient Estimation of Influence Functions for SIS Model on Social Networks IJCAI 2011 Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph IJCAI 2015 Influence Maximization in Big Networks An Incremental Algorithm for ... Non-monotone Adaptive Submodular Maximization IJCAI 2017 Robust Quadratic Programming for Price Optimization International Conference on Artificial Intelligence and Statistics AISTATS 2012 On Bisubmodular Maximization AISTATS 2018 Random Warping Series A Random Features Method for Time-Series Embedding International Workshop on Internet and Network Economics WINE 2007 Competitive Influence Maximization in Social Networks A Note on Maximizing the Spread of Influence in Social Networks WINE 2010 Threshold Models for Competitive Influence in Social Networks IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology WI-IAT 2009 From Dango to Japanese Cakes Query Reformulation Models and Patterns WI-IAT 2014 Lazy Walks Versus Walks with Backstep Flavor of PageRank Conference on Uncertainty in Artificial Intelligence UAI 2010 Maximizing the Spread of Cascades Using Network Design International Conference on Antonomous Agents and Multiagent Sytems AAMAS 2015 Dynamic Influence Maximization Under Increasing Returns to Scale AAMAS 2016 Robust Influence Maximization (Lowalekar+) KES (International Conference on Knowledge-Based Intelligent Information and Engineering Systems) Prediction of Information Diffusion Probabilities for Independent Cascade Model ISMIS (International Conference on Foundations of Intelligent Systems) Learning Diffusion Probability based on Node Attributes in Social Networks 機械学習 + ... Conference on Neural Information Processing Systems NIPS 2003 Learning with Local and Global Consistency NIPS 2004 An Application of Boosting to Graph Classification NIPS 2009 Random Walks with Random Projections NIPS 2013 http //connpass.com/event/4728/ Scalable Influence Estimation in Continuous-Time Diffusion Networks Distributed Representations of Words and Phrases and their Compositionality DeViSE A Deep Visual-Semantic Embedding Model A Gang of Bandits Similarity Component Analysis One-shot learning by inverting a compositional causal process Inverse Density as an Inverse Problem The Fredholm Equation Approach Approximate Bayesian Image Interpretation using Generative Probabilistic ... Playing Atari with Deep Reinforcement Learning Scalable kernels for graphs with continuous attributes More Effective Distributed ML via a Stale Synchronous Parallel Parameter Server NIPS 2014 Tight Bounds for Influence in Diffusion Networks and Application to Bond ... NIPS 2015 A Structural Smoothing Framework For Robust Graph-Comparison Anytime Influence Bounds and the Explosive Behavior of Continuous-Time ... Learnability of Influence in Networks A Submodular Framework for Graph Comparison https //stanford.edu/~jugander/NetworksNIPS2015/ ワークショップ NIPS 2016 Joint M-Best-Diverse Labelings as a Parametric Submodular Minimization Fast and Provably Good Seedings for k-Means Maximizing Influence in an Ising Network A Mean-Field Optimal Solution Budgeted stream-based active learning via adaptive submodular maximization Computing and maximizing influence in linear threshold and triggering models The Power of Optimization from Samples NIPS 2017 Stochastic Submodular Maximization The Case of Coverage Functions Robust Optimization for Non-Convex Objectives The Importance of Communities for Learning to Influence International Conference on Machine Learning ICML 2003 ✔Marginalized Kernels Between Labeled Graphs ICML 2011 Uncovering the Temporal Dynamics of Diffusion Networks Preserving Personalized Pagerank in Subgraphs ICML 2012 Influence Maximization in Continuous Time Diffusion Networks ICML 2014 Efficient Label Propagation ICML 2015 ✔Yinyang K-Means A Drop-In Replacement of the Classic K-Means with ... ACML (Asian Conference on Machine Learning) 2009 Learning Continuous-Time Information Diffusion Model for Social Behavioral ... 高性能計算 + ... IEEE International Parallel & Distributed Processing Symposium IPDPS 2016 Rabbit Order Just-in-time Parallel Reordering for Fast Graph Analysis PDPTA (International Conference on Parallel and Distributed Processing Techniques and Applications) Latent Feature Independent Cascade Model for Social Propagation 通信ネットワーク + ... IEEE International Conference on Computer Communications INFOCOM 2007 On a Routing Problem Within Probabilistic Graphs ... INFOCOM 2012 Approximate Convex Decomposition Based Localization in Wireless Sensor Networks INFOCOM 2013 2.5K-Graphs from Sampling to Generation Maximizing Submodular Set Function with Connectivity Constraint Theory and ... A Graph Minor Perspective to Network Coding Connecting Algebraic Coding ... INFOCOM 2014 Information Diffusion in Mobile Social Networks The Speed Perspective A General Framework of Hybrid Graph Sampling for Complex Network Analysis INFOCOM 2015 Assessing Attack Vulnerability in Networks with Uncertainty INFOCOM 2016 Cost-aware Targeted Viral Marketing in Billion-scale Networks INFOCOM 2017 Why approximate when you can get the exact? Optimal Targeted Viral Marketing ... WASA (Wireless Algorithms, Systems, and Applications) Minimum-Cost Information Dissemination in Social Networks 情報検索 + ... ACM International Conference on Research and Development in Information Retrieval SIGIR 2014 The Role of Network Distance in LinkedIn People Search Influential Nodes Selection A Data Reconstruction Perspective IMRank Influence Maximization via Finding Self-Consistent Ranking 自然言語処理 + ... Meeting of the Association for Computational Linguistics ACL 2011 Word Alignment via Submodular Maximization over Matroids ACL 2013 A user-centric model of voting intention from Social Media グラフィクス・ビジョン・HCI + ... ACM SIGCHI Conference on Human Factors in Computing Systems IEEE Conference on Computer Vision and Pattern Recognition CVPR 2014 Spectral Graph Reduction for Efficient Image and Streaming Video Segmentation superpixelでグラフを小さくして画像分割とかを効率化 SBP (International Workshop on Social Computing and Behavioral Modeling) 2009 Finding Influential Nodes in a Social Network from Information Diffusion Data Manuscript+Technical report Random-walk domination in large graphs problem definitions and fast solutions Lazier Than Lazy Greedy ✔A Fast and Provable Method for Estimating Clique Counts Using Turan s Theorem ジャーナル トップジャーナル KAIS (Knowledge and Information Systems) Efficient algorithms for influence maximization in social networks IPL (Information Processing Letters) A Fast and Practical Bit-Vector Algorithm for the Longest Common Subsequence ... Internet Mathematics Link Evolution Analysis and Algorithms Towards Scaling Fully Personalized PageRank Algorithms, Lower Bounds, and ... TKDD (Transactions on Knowledge Discovery from Data) 2009 Blocking Links to Minimize Contamination Spread in a Social Network TKDE 2013 Clustering Large Probabilistic Graphs 普通のジャーナル Computational Social Networks Efficient influence spread estimation for influence maximization under the ... Computers and Mathematics with Applications A practical bounding algorithm for computing two-terminal reliability based ... Dynamics of Information Systems Algorithmic Approaches Minimum-Risk Maximum Clique Problem Information Sciences Super mediator - A new centrality measure of node importance for information ... Minimizing the expected complete influence time of a social network Maximizing the spread of influence ranking in social networks 連続時間マルコフ連鎖を取り入れたICモデル JCO (Journal of Combinatorial Optimization) 2012 The complexity of influence maximization problem in the deterministic linear ... JSAC (IEEE Journal on Selected Areas in Communications) 2013 On Budgeted Influence Maximization in Social Networks SNAM (Social Network Analysis and Mining) 2012 On minimizing budget and time in influence propagation over social networks TPDS (IEEE Transactions on Parallel and Distributed Systems) IMGPU GPU-Accelerated Influence Maximization in Large-Scale Social Networks フォーカス外 Maximizing the Extent of Spread in a Dynamic Network ICEC (International Conference on Electronic Commerce) Maximizing Influence in a Competitive Social Network A Follower s Perspective WISE 2013 A Novel and Model Independent Approach for Efficient Influence Maximization ... 国内会議 人工知能学会 JSAI Resampling-based Predictive Simulation for Identifying Influential Nodes ... Finding Important Users for Information Diffusion Influence analysis of information diffusion focusing on directed networks Proposal of AIDM Agent-based Information Diffusion Model Predicting Japanese General Election in 2013 with Twitter Considering ... Which Targets to Contact First to Maximize Influence over Social Network 他分野 Econometrica The Network Origins of Aggregate Fluctuations PLoS ONE Social Network Sensors for Early Detection of Contagious Outbreaks Proceedings of the National Academy of Sciences PNAS Dynamic social networks promote cooperation in experiments with humans Spectral Redemption Clustering Sparse Networks Physical Review Letters First Passage Time for Random Walks in Heterogeneous Networks Adaptation and Optimization of Biological Transport Networks Locating the Source of Diffusion in Large-Scale Network Enhanced Flow in Small-World Networks Science Quantifying Long-Term Scientific Impact Control Profiles of Complex Networks Nature Communications Griffiths phases and the stretching of criticality in brain networks A scaling law for random walks on networks Influence maximization in complex networks through optimal percolation 2024-04-23 23 09 41 (Tue)
https://w.atwiki.jp/touhoukashi/pages/3565.html
【登録タグ R THE OTHER FLOWER YURiCa/花たん 万年置き傘にご注意を 曲 楓】 【注意】 現在、このページはJavaScriptの利用が一時制限されています。この表示状態ではトラック情報が正しく表示されません。 この問題は、以下のいずれかが原因となっています。 ページがAMP表示となっている ウィキ内検索からページを表示している これを解決するには、こちらをクリックし、ページを通常表示にしてください。 /** General styling **/ @font-face { font-family Noto Sans JP ; font-display swap; font-style normal; font-weight 350; src url(https //img.atwikiimg.com/www31.atwiki.jp/touhoukashi/attach/2972/10/NotoSansCJKjp-DemiLight.woff2) format( woff2 ), url(https //img.atwikiimg.com/www31.atwiki.jp/touhoukashi/attach/2972/9/NotoSansCJKjp-DemiLight.woff) format( woff ), url(https //img.atwikiimg.com/www31.atwiki.jp/touhoukashi/attach/2972/8/NotoSansCJKjp-DemiLight.ttf) format( truetype ); } @font-face { font-family Noto Sans JP ; font-display swap; font-style normal; font-weight bold; src url(https //img.atwikiimg.com/www31.atwiki.jp/touhoukashi/attach/2972/13/NotoSansCJKjp-Medium.woff2) format( woff2 ), url(https //img.atwikiimg.com/www31.atwiki.jp/touhoukashi/attach/2972/12/NotoSansCJKjp-Medium.woff) format( woff ), url(https //img.atwikiimg.com/www31.atwiki.jp/touhoukashi/attach/2972/11/NotoSansCJKjp-Medium.ttf) format( truetype ); } rt { font-family Arial, Verdana, Helvetica, sans-serif; } /** Main table styling **/ #trackinfo, #lyrics { font-family Noto Sans JP , sans-serif; font-weight 350; } .track_number { font-family Rockwell; font-weight bold; } .track_number after { content . ; } #track_args, .amp_text { display none; } #trackinfo { position relative; float right; margin 0 0 1em 1em; padding 0.3em; width 320px; border-collapse separate; border-radius 5px; border-spacing 0; background-color #F9F9F9; font-size 90%; line-height 1.4em; } #trackinfo th { white-space nowrap; } #trackinfo th, #trackinfo td { border none !important; } #trackinfo thead th { background-color #D8D8D8; box-shadow 0 -3px #F9F9F9 inset; padding 4px 2.5em 7px; white-space normal; font-size 120%; text-align center; } .trackrow { background-color #F0F0F0; box-shadow 0 2px #F9F9F9 inset, 0 -2px #F9F9F9 inset; } #trackinfo td ul { margin 0; padding 0; list-style none; } #trackinfo li { line-height 16px; } #trackinfo li nth-of-type(n+2) { margin-top 6px; } #trackinfo dl { margin 0; } #trackinfo dt { font-size small; font-weight bold; } #trackinfo dd { margin-left 1.2em; } #trackinfo dd + dt { margin-top .5em; } #trackinfo_help { position absolute; top 3px; right 8px; font-size 80%; } /** Media styling **/ #trackinfo .media th { background-color #D8D8D8; padding 4px 0; font-size 95%; text-align center; } .media td { padding 0 2px; } .media iframe nth-of-type(n+2) { margin-top 0.3em; } .youtube + .nicovideo, .youtube + .soundcloud, .nicovideo + .soundcloud { margin-top 0.75em; } .media_section { display flex; align-items center; text-align center; } .media_section before, .media_section after { display block; flex-grow 1; content ; height 1px; } .media_section before { margin-right 0.5em; background linear-gradient(-90deg, #888, transparent); } .media_section after { margin-left 0.5em; background linear-gradient(90deg, #888, transparent); } .media_notice { color firebrick; font-size 77.5%; } /** Around track styling **/ .next-track { float right; } /** Infomation styling **/ #trackinfo .info_header th { padding .3em .5em; background-color #D8D8D8; font-size 95%; } #trackinfo .infomation_show_btn_wrapper { float right; font-size 12px; user-select none; } #trackinfo .infomation_show_btn { cursor pointer; } #trackinfo .info_content td { padding 0 0 0 5px; height 0; transition .3s; } #trackinfo .info_content ul { padding 0; margin 0; max-height 0; list-style initial; transition .3s; } #trackinfo .info_content li { opacity 0; visibility hidden; margin 0 0 0 1.5em; transition .3s, opacity .2s; } #trackinfo .info_content.infomation_show td { padding 5px; height 100%; } #trackinfo .info_content.infomation_show ul { padding 5px 0; max-height 50em; } #trackinfo .info_content.infomation_show li { opacity 1; visibility visible; } #trackinfo .info_content.infomation_show li nth-of-type(n+2) { margin-top 10px; } /** Lyrics styling **/ #lyrics { font-size 1.06em; line-height 1.6em; } .not_in_card, .inaudible { display inline; position relative; } .not_in_card { border-bottom dashed 1px #D0D0D0; } .tooltip { display flex; visibility hidden; position absolute; top -42.5px; left 0; width 275px; min-height 20px; max-height 100px; padding 10px; border-radius 5px; background-color #555; align-items center; color #FFF; font-size 85%; line-height 20px; text-align center; white-space nowrap; opacity 0; transition 0.7s; -webkit-user-select none; -moz-user-select none; -ms-user-select none; user-select none; } .inaudible .tooltip { top -68.5px; } span hover + .tooltip { visibility visible; top -47.5px; opacity 0.8; transition 0.3s; } .inaudible span hover + .tooltip { top -73.5px; } .not_in_card span.hide { top -42.5px; opacity 0; transition 0.7s; } .inaudible .img { display inline-block; width 3.45em; height 1.25em; margin-right 4px; margin-bottom -3.5px; margin-left 4px; background-image url(https //img.atwikiimg.com/www31.atwiki.jp/touhoukashi/attach/2971/7/Inaudible.png); background-size contain; background-repeat no-repeat; } .not_in_card after, .inaudible .img after { content ; visibility hidden; position absolute; top -8.5px; left 42.5%; border-width 5px; border-style solid; border-color #555 transparent transparent transparent; opacity 0; transition 0.7s; } .not_in_card hover after, .inaudible .img hover after { content ; visibility visible; top -13.5px; left 42.5%; opacity 0.8; transition 0.3s; } .not_in_card after { top -2.5px; left 50%; } .not_in_card hover after { top -7.5px; left 50%; } .not_in_card.hide after { visibility hidden; top -2.5px; opacity 0; transition 0.7s; } /** For mobile device styling **/ .uk-overflow-container { display inline; } #trackinfo.mobile { display table; float none; width 100%; margin auto; margin-bottom 1em; } #trackinfo.mobile th { text-transform none; } #trackinfo.mobile tbody tr not(.media) th { text-align left; background-color unset; } #trackinfo.mobile td { white-space normal; } document.addEventListener( DOMContentLoaded , function() { use strict ; const headers = { title アルバム別曲名 , album アルバム , circle サークル , vocal Vocal , lyric Lyric , chorus Chorus , narrator Narration , rap Rap , voice Voice , whistle Whistle (口笛) , translate Translation (翻訳) , arrange Arrange , artist Artist , bass Bass , cajon Cajon (カホン) , drum Drum , guitar Guitar , keyboard Keyboard , mc MC , mix Mix , piano Piano , sax Sax , strings Strings , synthesizer Synthesizer , trumpet Trumpet , violin Violin , original 原曲 , image_song イメージ曲 }; const rPagename = /(?=^|.*
https://w.atwiki.jp/jhigashi/pages/15.html
-Conferences (reviewed)/ 学会発表(査読あり) ※特に表記していない場合は口頭発表です。 Jin Higashijima, Kitetsu Takahashi, Manabu Oi and Kazuto Kato, Ethical implications emerging from research into the genetic and genomic aspects of autism spectrum disorders A qualitative study of parental opinions in Japan. the American Society of Human Genetics 2010 Annual Meeting, Washington DC, United States of America, November 4, 2010. (Poster 1412) 東島仁・高橋貴哲・大井学・加藤和人, 自閉症スペクトラム障害の遺伝的側面の研究が家族にもたらす倫理・社会的課題の検討. 日本人類遺伝学会第55回大会,大宮ソニックシテイィ,2010年10月28日. Jin Higashijima, Scientific advancement and society the autism spectrum disorders case in Japan. Society for Social Studies of Science/ Japanese Society for Science and Technology Studies 2010 annual meeting, Tokyo University, Tokyo, Japan. August 26, 2010. Shuhei Miyashita, Atsushi Aoyama, Mikiro Nawa, Jin Higashijima, Kei Sakamoto, Tomoko Nozoye, Takayuki Kobayashi, Hierarchical Analysis on Cognitive Systems". The 4th International Conference on Cognitive Systems. ETH Zurich, Switzerland, in Proceedings (#80, p.28). January 27-28, 2010. Jin Higashijima, Ethical implications of research on the genetic aspects of autism spectrum disorders A qualitative study of parental opinions in Japan. East Asian STS Young Scholar’s Meeting in Kobe, Kobe University, Kobe, Japan. December 2009. 東島仁・加藤和人,自閉性スペクトラム障害の遺伝的側面の研究における倫理・社会的課題の検討,日本人類遺伝学会第54回大会,高輪プリンスホテル, 2009年9月26日. 東島仁・加藤和人,自閉性スペクトラム障害の遺伝的側面の研究における倫理・社会的課題の検討,第9回臨床遺伝研究会,高輪プリンスホテル, 2009年9月24日. 八幡彩子・東島仁・加藤和人, 論文要旨のテキスト解析によるシロイヌナズナのゲノム研究の動向の推移と影響の分析, 第31回日本分子生物学会年会第81回日本生化学会大会合同大会1P-1402, 神戸ポートアイランド, 2008年12月9日.(Poster) Jin Higashijima, Kae Takahashi and Kazuto Kato, Heterogeneity among life science researchers why should we consider it seriously? Third International Applied Ethics Conference, Sapporo University, Sapporo, Japan, November 23, 2008. Jin Higashijima, Human society and individual differences in human minds consideration on the opinions of the Japanese life sciences researchers, Poster session and Talk Relay by Kyoto University Junior Researchers Rethinking Difference in The 12th Kyoto University International Symposium(KUIS-12) "Transforming Racial Images Analyses of Representations", Kyoto University, Kyoto, Japan, December 5, 2008. Jin Higashijima, Kae Takahashi and Kazuto Kato, Ethical and Social Aspects of Behavioural Genomics What are the Opinions of Life Scientists? Translating ELSI Global Perspectives on the Ethical, Legal and Social Implications of Human Genome Research, Renaissance Hotel, Cleveland, Ohio, May 2, 2008. Jin Higashijima, Kitetsu Takahashi and Kazuto Kato, Opinions of Japanese life scientists on ethical, legal and social implications of behavioural genetics, American Society of Human Genetics 2007 Annual Meeting, San Diego Convention Center, San Diego, United States of America, October, 2007. (Poster) 東島仁・加藤和人, 日本の生命科学研究者から見た行動遺伝学研究に関する倫理・社会的問題,第51回日本人類遺伝学会,P-100, 米子コンベンションセンター,2006年10月.(Poster) Jin Higashijima and Kazuto Kato, Opinions of Life Scientists on Science Communication in Japan, Public Communication of Science Technology, COEX, Seoul, Korea, May 2006. (Poster) -Non-reviewed conferences ・ workshops/ 査読なしの学会や研究会など ※特に表記していない場合は口頭発表です。 東島仁, 「疾患研究に,誰の視点をどう取り込むか? - 英国の取り組み事例とその背景-, 科学コミュニケーション研究会 第19回関西支部勉強会, 京都大学,2012年5月7日. 東島仁・中村征樹,自閉症と社会の関係構築に対する市民からの問題提起,STS Network Japan研究発表会, 東京大学,2012年3月25日. ※査読がないわけでもないのですが、査読あり!というほどでもないような・・・よく分からない・・・ 東島仁・高橋可江・中村征樹ほか(自閉症にやさしい社会の実現に向けたコンセンサス会議2010「自閉症を巡る科学と社会の対話」企画委員会), 自閉症にやさしい社会の実現に向けた対話の取り組み, サイエンスアゴラ2010, 日本科学未来館他, 2010年11月20-21日.※審査はあるのですが、「学会」ではないのでこちらに書いてみました。さてさて。 山内保典・東島仁, 自閉症の共生と治療に向けたコンセンサス会議にむけてのワークショップ, 金沢大学, 2010年6月29日. 東島仁, 北陸科学コミュニケーション・アウトリーチ研究会, ヴィアイン金沢, 2010年6月20日. 東島仁, 市民と研究者の関係づくりに対する研究者の意識とは, 第1回名称非公開学術研究会, 大阪大学,2010年6月11日. Jin Higashijima, Considering social aspects of mind and behavior research An Autism Spectrum Disorders case, Brown bag lecture "Social Development of human infant its model and disorders" in AI lab in University of Zurich, Second. March. 2010. Jin Higashijima, Science and society Autism case in Japan, The 1st Japanese-Korean Workshop for Young STS Scholars. Soel University, Korea. March 19-20, 2010. 東島仁, 自閉症スペクトラム障害の遺伝的側面の研究における倫理・社会的課題の検討, 自閉症遺伝子研究の倫理勉強会, 金沢大学, 2010年2月18日. 東島仁,必要なのは知識なのか?―日本の大学生における遺伝とゲノム変異に関する基礎知識調査からの問題提起, STS Network Japan研究発表会, 大阪大学,2009年3月28日. 東島仁,「ウェブを介した研究者自身の情報発信に対する-「社会的な」しかし「明確でない」要請?」, 第3回ARGカフェ@京都 2009年1月19日. 東島仁, 生命科学研究者は、研究の応用可能性や社会的課題についてどう考えているのか?,STS Network Japan研究会,東京工業大学,2007年6月. 東島仁, 研究者の科学に対する意見の多様性と、その社会的影響,STS Network Japan春の研究発表会,東京工業大学,2007年3月. 東島仁・加藤和人, 日本における生命科学研究とマス・メディアの関係(シンポジウム企画),分子生物学会2006フォーラム,名古屋国際会議場,2006年12月. Jin Higashijima and Kazuto Kato, Opinions of Japanese Life Scientists on Science Communication, The 4th International Student Seminar, Kyoto University, Kyoto, Japan, March 2006. (Poster) 小嶋祥三・斉藤光太郎・東島仁・橋本照男, 近赤外分光法(NIRS)の可能性, 日本心理学会第68回大会,1PM094,関西大学,2004年9月.(Poster) Jin Higashijima, Spatial Working Memory in Pigeons, COE International Symposium Comparative Cognition, Keio University, Tokyo, Japan, December 2002. 東島仁・渡辺茂, ハトの空間記憶における比較刺激と遅延の効果,日本動物心理学会第63回大会・日本基礎心理学会第22回大会合同大会,1P044,つくば国際会議場,2003年10月. (Poster) 東島仁・渡辺茂, ハトの位置学習に及ぼす比較刺激と遅延の効果, 日本基礎心理学会第21回大会,1P044,千葉大学,2002年11月.(Poster) 東島仁・渡辺茂, ハトの空間位置の学習に及ぼす遅延の効果,日本動物心理学会第62回大会,P-2-8,同志社大学,2002年8月.(Poster) 東島仁・坂上貴之, 異なる条件性強化子の強化の提示予告度・提示割合が、ハトの選択に及ぼす効果,日本基礎心理学会第20回大会,関西学院大学,2001年7月. (Poster) - Commentator/Moderator etc... (commentator) 『概念分析の社会学―社会的経験と人間の科学』合評会, STS network Japan,大阪大学, 2010年1月11日. (chair) (Moderator) 「自閉症の共生と治療に向けたコンセンサス会議にむけてのワークショップ」,金沢大学, 2010年6月29日. ※議論セッション 「一緒に見よう、な! -生命科学を視覚化する-」, 第10回生命科学と社会のコミュニケーション研究会, 京都大学,2009年8月6日. 講演者 西川実希/長神風二/竹村真由子/奈良島知行 コメンテーター 加納圭 STS Network Japan2008年度 冬のシンポジウム ―変遷する「正常」―, STS network Japan, 京都大学, 2009年1月24日. 講演者 土屋敦/池田光穂/美馬達哉 コメンテーター 中村征樹 「科学コミュニケーションを捉え直すー生命科学とマス・メディアー」第9回生命科学と社会のコミュニケーション研究会, 京都大学, 2009年1月17日. 講演者 内田麻理香/田中幹人/春日匠 「社会の中の科学-メディア分析から見るナノテクノロジー-」, 第8回生命科学と社会のコミュニケーション研究会, 京都大学, 2008年6月16日. 講演者 Kristian Hvidtfelt Nielsen(オーフス大学) 「生命科学と社会の関係を考えるーメディア分析から場作りまでー」, 第7回生命科学と社会のコミュニケーション研究会, 京都大学, 2008年2月15日. 講演者 標葉隆馬/森田華子/新美耕平/高橋可江/平川秀幸 「科学と社会の関係を考えるー科学計量学の視点から」, 第6回生命科学と社会のコミュニケーション研究会, 京都大学, 2007年7月28日. 講演者 柴山 盛生/阪 彩香 「科学者・技術者のコミュニケーション活動への関わり方を考える」, 第4回生命科学と社会のコミュニケーション研究会, 京都大学, 2006年7月22日. 講演者 西條美紀/Douglas Sipp ※抜けている分は、そのうちに追加します。司会と座長が幾つか抜けています、、ね。
https://w.atwiki.jp/cadencii_en/pages/72.html
English 日本語 Release Note Release Date comming soon... Notes Cadencii requires ".NET Framework Runtime Library(version 2.0 or later)" and "Visual C++ 2010 Runtime Library". Installer of these runtimes are available from the links below. .NET Framework Runtime Library Download .NET Framework 3.5 SP1 Visual C++ 2010 Runtime Library Microsoft Visual C++ 2010 Redistributable Package (x86) Cadencii can be launched with the latest version of mono. This enable you to use Cadencii with many platforms supported by mono. (Note Several functions using VOCALOID2 VSTi are not available in this case.) Mono is available from the link mono download Download Windows version Cadencii version 3.4.1 (6.7MB) Macintosh version Cadencii version 3.4.1 (42.5MB) Get codes Source code is available on SourceForege.JP. Please follow the instruction below for checking out the SourceForge.JP s SVN repository. svn checkout -r 1739 http //svn.sourceforge.jp/svnroot/cadencii/Cadencii/branches/3.4 ./ These svn command is for checiking out "THIS" version of Cadencii. In order to get the latest source codes, please remove "-r" option.
https://w.atwiki.jp/streamergta5/pages/1667.html
組織名 ACADEMY(アカデミー) 業種 傭兵派遣業 設立日 2024年5月25日 本拠地 6072番地 所属 ARCANA 取り纏め アドミゲス・ハンJD + 目次を開く 目次 基本情報 活動内容 依頼情報依頼手順 雇用情報加盟一覧 不動産関連 歴史年表 情報提供&リスナー交流場 基本情報 概要 ARCANA幹部のアドミゲス・ハンとJDが取り纏めを務める民間軍事会社。 信用と実績のある傭兵人材の派遣業を主とする。 また、ARCANAビジネス広告塔の側面も担っている。 ポリシー 全てのギャングに平等に。 クライアントの意向重視。どのような要望でも聞き入れる。 信頼重視。仕事中に得た情報は一切外に漏らさない。 責任はARCANAトップの無馬が受け持つが、使えないと判断すれば切り捨てる。 全ての半グレに平等に。 協力者はいつ抜けてもOKな比較的自由な制度。 単発的な仕事の斡旋を受けられる。 注意 ACADEMYはギャングや警察に対する武力組織ではない。 あくまで、半グレや黒市民が路頭に迷わない為の受け皿もしくは止まり木としての役割を担う。 🔝ページTOPへ 活動内容 1.ARCANAへの協力 ▪ 取引現場における護衛。 ▪ FEMME FATALE製武器の性能テスト及び宣伝。 2.人材派遣 ▪ ギャング組織からの傭兵依頼。 ▪ 依頼内容は戦闘員からドライバーまで多岐にわたる。 3.人材育成 ▪ 実績のない半グレの育成。 ▪ 大型犯罪経験のある人材が教官役となる。 ▪ 麻陀羅組の大型枠を使った訓練を予定。 ▪ 犯罪知識や戦闘技術だけでなく、ギャングとの接し方も教育。 ▪ 各ギャングへの足掛かりの場としても機能させる狙い。 🔝ページTOPへ 依頼情報 発注条件 ▪ 報酬は現金のみ対応。 ▪ ARCANAビジネスに干渉するため BM払いはNG。 ▪ 罰金、武器装備等の用意は不要。 ▪ 犯罪道具など、攻略に必要なものはギャングにて用意する。 報酬額 ▪ 人数関係なくミッション毎の固定額。 ▪ ミッション成功時報酬の総額2割を目安。 ▪ 頂いた報酬から生徒保証分と教師給料を引いた半額をARCANAへ。 - 相場 相場 作戦名 Rank 成功数 備考 作戦名 Rank 成功数 備考 サーマル D 多数 サーマイトの代理入手。報酬は教師陣のみ。100万/1個で買取。 パレト D 2/2 飛行場 C 1/1 リグ C 1/1 客船 B 3/4 ボブキャ B 1/2 アーティ A 2/2 ユニオン A 2/2 パシ S 0/0 カジノ S 0/1 麻陀羅枠 ▪ 対外的には麻陀羅が受注し傭兵を呼ぶ形。 ▪ 双方で、行きたい大型があった時に依頼。 ▪ 依頼時はグループメッセージを利用。 ▪ 報酬は8(ACADEMY):2(麻陀羅) 依頼者リスト - 一覧 組織 コード 利用 備考 組織 コード 利用 備考 MOZU MOZU-7385 5回 NGリスト :柳田、元CC 餡ブレラ ANB-0731 2回 NGリスト :ハン、(小峯)、イネヌコ GBC GBC-0152 3回 ALLIN ALLIN-7055 NO LIMIT NL-7209 麻陀羅組 (MDR-1010) 2回 特別契約 868 868-3077 コード:専用ダークチャット入出用パスコード + 過去情報 過去情報 組織 コード 備考 組織 コード 利用 備考 concellge CC-4982 解散 IRiS IRIS-2907 3回 解散 依頼手順 発注側手順 ①専用ダークチャットへ内容を添えて依頼 ②責任者からコンタクト。無線共有。内容のすり合わせ。 ③依頼成立後、集合し作戦開始。 ④成功時、責任者(教師or無馬)へ依頼料を振込。 受注側手順 ①ARCANAの方から傭兵要請を受ける。 ②ダークチャット「#Academy」にて内容と無線の共有。 ③加盟者で行ける人が指定の無線に入りミッションを行う。 ④終了後、責任者(教師or無馬)へ最低保証金を請求。 (⑤教師陣は後から無馬へ総額を請求。) 🔝ページTOPへ 雇用情報 加盟条件 ▪ ギャングに所属していないこと ▪ 信頼のおける人間であること ▪ 最終的に巣立つ意思があること 就業規則 ▪ 傭兵時に得た情報は漏らさない。 ▪ 罰金は自分らの責任とし、自分で支払う。 ▪ 大型犯罪への参加はギャングより少ない回数に制限。 ▪ 私用を含め各個人3回まで。(個人医は1回) 福利厚生 ▪ ARCANAより、武器・装備・クラフト素材の支給。 ▪ 武器を持ち込んだ際はARCANAにて買取。 ▪ 不祥事を起こした際は無馬が責任を負担。 ▪ 大型作戦のみ最低罰金を保証する手当を支給。(現在300万) ▪ 教師陣は大型作戦毎の固定額を支給。(現在1500万円) ▪ 支給額が報酬で賄えない場合ARCANAより補填。 加盟一覧 在学一覧 - 一覧 🎖️ = 取り纏め 加盟日 名前 区分 紹介 備考 経歴 加盟日 名前 区分 紹介 備考 経歴 '24/05/23 無馬 かな 🎖️ - 理事長 傭兵事業の発起人。経費を出し、ケツモチしてくれる人。教師陣が居ない際に依頼を引き受けたり指示出しをする。 元ALLIN UBARCANA代表 '24/05/23 アドミゲス・ハン 🎖️ 教師 IRiS脱退後、利害関係の一致にて加盟。ギャング時代の知識を活かし、作戦立案やIGLを担当。 ARCANAJOINを機に代表へ。JDと共に取り纏めを行う。 元IRiS UBARCANA幹部 '24/05/24 J D 🎖️ 教師 探し人関連で黒い情報が集まる場を探しているところ大 川さんの紹介で傭兵部隊へ。 取り纏めを行うことから校長と呼ばれている。 元軍人の半グレARCANA幹部 '24/05/24 柳田 ライアン 教師 無馬の命で傭兵部隊を率いる。古巣と対峙したとしても引き金を引く覚悟を持つ。 元MOZUNo.2ARCANA所属 '24/05/31 イネヌコ 生徒 CC解散に伴い半グレへ。銃の腕を鈍らせない為に加盟を決意。未経験であった半グレ人生をゆっくり謳歌したいとも語る。 元concellge '24/06/02 ぺお シルヴァ 生徒会長 CC解散に伴い半グレへ。MOZUの睨みが後押しとなり加入を決意。一度教えたことしっかり覚え説明できる有能な人材。 教師不在時は臨時でACADEMYをまとめる。 元concellge UB '24/06/02 モーガン・フリーザン 生徒 CC解散に伴い半グレへ。MOZUの睨みが後押しとなり加入を決意。無馬の優しい声が好きと本人に告白。 元concellge '24/06/02 タコマツ 生徒 CC解散に伴い半グレへ。MOZUの睨みが後押しとなり加入を決意。少し抜けてることがあるらしい。 元concellge '24/06/02 鬼野 ねね - 生徒 生徒兼、備品補充係。無馬から直接、暇なときに傭兵に行ってもいいと許可が出ている。 ARCANA幹部個人医 '24/06/05 雪菱 メラ 生徒 MOZUのイチカさんからの紹介で入った半グレ。ヘリの操縦に長けており、Froggerを貸与されている。 半グレ '24/06/05 小峯 玲 教師 元々ARCANAへ勧誘していたが機会が合わず、傭兵事業の方へ。持ち前の面倒見の良さから、生徒育成の面で期待を寄せている。 元IRiS '24/06/07 チョコラータ メアリー 生徒 CC解散に伴い半グレへ。元CCメンバーの後押しで加入を決意。 元concellge '24/06/09 K T 生徒 犬億ロックと行動を共にしていた半グレ。ヘリ担当希望にて加盟。 半グレ '24/06/14 生雲丹 よづな 生徒 IRiS解散に伴い半グレへ。ともに犯罪する仲間を求めて加盟。ヘリの運転に自信を持っている。 元IRiS '24/06/14 飯田 けんつ 生徒 個人犯罪を一通り経験し、人数が要る犯罪をするため加盟。 半グレ '24/06/14 シュガー ピーチ 生徒 IRiS解散に伴い半グレへ。寂しさに耐えられず道を模索する間の止まり木として加盟。 元IRiS Academyのダークチャットに入っている者を加盟とする + バイト登録半グレ 閉じる 名前 備考 猫魚 あかり 街で出会った半グレ。キキララのララの方。 兎依 とい 街で出会った半グレ。キキララのキキの方。 レキ ウィステリア 復讐に燃える半グレ。ギャングに入り力をつけることを目標としている。 休学一覧 + 一覧 在学期間 名前 区分 紹介 備考 経歴 在学期間 名前 区分 紹介 備考 経歴 '24/05/28~'24/06/13 犬億 ロック 生徒 ARCANAへ半グレ情報を提供している半グレ。傭兵業について無馬へ相談したのがきっかけで加盟。 メカニック体験の為休学中 半グレ 🔝ページTOPへ 不動産関連 + 拠点 番地 場所 通称 管理 備考 番地 場所 通称 管理 備考 6072 高級住宅地 傭兵幹部拠点職員室 無馬 傭兵会社側の拠点。雰囲気のあるガンハウス。ARCANAから支給される物資はここに保管される。 6072 高級住宅地 傭兵拠点教室 無馬 傭兵社員用の拠点。ガレージ付き。半グレが出入りする用の部屋となっている為、必要最低限のみの物資保管となっている。 6192 高級住宅地 柳田診療所 柳田 柳田が開業医として使用している診療所。何かあった際のセーフハウスとして利用できるよう情報共有済。 歴史 年表 ◆ 2024年 - 開く 日付 出来事 関係者 エピソード・備考 日付 出来事 関係者 エピソード・備考 '24/05/23 民間軍事会社事業の発足 無馬 '24/05/25 民間軍事会社設立 無馬、柳田 傭兵事業を行う機関の名称が「ACADEMY」に決定。柳田が代表に。 '24/05/25 拠点の設置 ACADEMY 傭兵部隊のみが利用する拠点を構えられる。加盟者によって顔合わせが行われる。 '24/05/28 ACADEMY本格始動 ARCANA ARCANA(無馬)により各ギャングボスに事業開始を通達。依頼受注環境整備が行われ、本格始動へ。 '24/05/28 代表交代 JD 取り纏め役が柳田からJDへ移行。 '24/05/30 会議 半グレの雇用形態や報酬面に関して制定する。 '24/06/04 麻陀羅組と提携 麻陀羅組 大型枠をすべて提供してもらう契約を結ぶ。 '24/06/07 アドミゲス・ハン代表へ アドミゲス・ハン いつかギャングへ行くJDの後続として代表に就任。 '24/06/09 第一回武器性能テスト FEMME FATALE FF製武器「APピストル」の性能テストを行う。 🔝ページTOPへ 情報提供&リスナー交流場 追加してほしいエピソードや修正・削除してほしい内容があればこちらにコメントをお願いします。 【コメントの履歴はこちら】 MOZUというかヴァンさんのアカデミーへの姿勢は確か、元CCの傭兵は使わないだった気がします。アカデミーの傭兵がNGではなかったような。 - sky1022 (2024-06-06 22 32 38) サーマルって、毎日のようにやっているし何回か失敗している記憶があるので、多分もう追えなくなってきている気がします。大型ではないから外すのもアリかもしれないと思いました。 - 名無しさん (2024-06-07 11 46 26) 正式加入前の話になりますが、小峯さんはハンさんと共に餡ブレラからNGを出されていたはずです。修正していただければと思います。 - HL (2024-06-12 10 30 41) 名前 🔝ページTOPへ
https://w.atwiki.jp/cadencii_en/pages/52.html
English 日本語 Release Note Release Date 1 Jun, 2009 Notes Cadencii requires ".NET Framework Runtime(version 2.0 or later)" and "Visual C++ Library DLLs". Installers of these rumtimes are available from the links below. .NET Framework Runtime Download .NET Framework 3.5 SP1 Visual C++ Library DLL Microsoft Visual C++ 2008 Redistributable Package (x86) Cadencii can be launched with the latest version of mono. This enable you to use Cadencii with many platforms supported by mono. (Note Several functions using VOCALOID2 VSTi are not available in this case.) Mono is available from the link mono download Download Cadencii version 2.0.1 (565KB) CadenciiSDK version 2.0 (455KB) How to get source codes Source code is available on SourceForege.JP. Please follow the instruction below for checking out the SourceForge.JP s SVN repository. svn checkout -r 216 http //svn.sourceforge.jp/svnroot/cadencii/branches/2.0 ./ These svn command is for checiking out "THIS" version of Cadencii. In order to get the latest source codes, please remove "-r" option.
https://w.atwiki.jp/cadencii_en/pages/54.html
English 日本語 Release Note Release Date 24 May, 2009 Notes Cadencii requires ".NET Framework Runtime(version 2.0 or later)" and "Visual C++ Library DLLs". Installers of these rumtimes are available from the links below. .NET Framework Runtime Download .NET Framework 3.5 SP1 Visual C++ Library DLL Microsoft Visual C++ 2008 Redistributable Package (x86) Cadencii can be launched with the latest version of mono. This enable you to use Cadencii with many platforms supported by mono. (Note Several functions using VOCALOID2 VSTi are not available in this case.) Mono is available from the link mono download Download Cadencii version 1.4.5 (411KB) CadenciiSDK version 1.3 (387KB) How to get source codes Source code is available on SourceForege.JP. Please follow the instruction below for checking out the SourceForge.JP s SVN repository. svn checkout -r 177 http //svn.sourceforge.jp/svnroot/cadencii/branches/1.4 ./ These cvs / svn command is for checiking out "THIS" version of Cadencii. In order to get the latest source codes, please remove "-r" options from these commands.
https://w.atwiki.jp/cadencii_en/pages/71.html
English 日本語 Release Note Release Date 8 May, 2011 Notes Cadencii requires ".NET Framework Runtime Library(version 2.0 or later)" and "Visual C++ 2010 Runtime Library". Installer of these runtimes are available from the links below. .NET Framework Runtime Library Download .NET Framework 3.5 SP1 Visual C++ 2010 Runtime Library Microsoft Visual C++ 2010 Redistributable Package (x86) Cadencii can be launched with the latest version of mono. This enable you to use Cadencii with many platforms supported by mono. (Note Several functions using VOCALOID2 VSTi are not available in this case.) Mono is available from the link mono download Download Windows version Cadencii version 3.4.0 (6.7MB) Macintosh version Cadencii version 3.4.0 (42.4MB) Get codes Source code is available on SourceForege.JP. Please follow the instruction below for checking out the SourceForge.JP s SVN repository. svn checkout -r 1605 http //svn.sourceforge.jp/svnroot/cadencii/Cadencii/branches/3.4 ./ These svn command is for checiking out "THIS" version of Cadencii. In order to get the latest source codes, please remove "-r" option.